./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 19:05:51,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:05:51,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:05:51,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:05:51,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:05:51,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:05:51,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:05:51,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:05:51,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:05:51,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:05:51,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:05:51,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:05:51,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:05:51,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:05:51,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:05:51,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:05:51,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:05:51,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:05:51,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:05:51,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:05:51,309 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:05:51,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:05:51,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:05:51,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:05:51,313 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:05:51,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:05:51,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:05:51,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:05:51,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:05:51,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:05:51,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:05:51,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:05:51,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:05:51,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:05:51,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:05:51,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:05:51,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:05:51,348 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:05:51,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:05:51,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:05:51,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:05:51,353 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:05:51,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:05:51,353 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:05:51,353 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:05:51,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:05:51,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:05:51,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:05:51,354 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:05:51,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:05:51,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:05:51,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:05:51,356 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:05:51,356 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:05:51,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:05:51,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:05:51,358 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:05:51,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:05:51,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:05:51,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:05:51,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:05:51,359 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:05:51,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:05:51,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2019-01-01 19:05:51,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:05:51,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:05:51,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:05:51,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:05:51,427 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:05:51,427 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-01 19:05:51,495 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc36c8ed4/742a04a7052f48f49c380d16788cbf0d/FLAGa076e9172 [2019-01-01 19:05:52,028 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:05:52,029 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-01 19:05:52,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc36c8ed4/742a04a7052f48f49c380d16788cbf0d/FLAGa076e9172 [2019-01-01 19:05:52,340 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc36c8ed4/742a04a7052f48f49c380d16788cbf0d [2019-01-01 19:05:52,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:05:52,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:05:52,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:05:52,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:05:52,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:05:52,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:05:52" (1/1) ... [2019-01-01 19:05:52,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f2e1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:52, skipping insertion in model container [2019-01-01 19:05:52,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:05:52" (1/1) ... [2019-01-01 19:05:52,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:05:52,429 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:05:52,869 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:05:52,893 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:05:53,074 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:05:53,148 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:05:53,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53 WrapperNode [2019-01-01 19:05:53,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:05:53,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:05:53,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:05:53,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:05:53,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (1/1) ... [2019-01-01 19:05:53,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:05:53,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:05:53,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:05:53,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:05:53,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (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-01-01 19:05:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:05:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:05:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:05:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:05:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:05:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:05:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:05:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:05:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:05:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:05:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:05:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:05:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:05:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:05:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:05:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:05:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:05:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:05:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:05:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:05:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:05:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:05:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:05:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:05:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:05:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:05:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:05:53,359 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:05:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:05:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:05:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:05:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:05:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:05:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:05:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:05:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:05:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:05:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:05:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:05:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:05:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:05:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:05:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:05:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:05:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:05:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:05:54,523 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:05:54,523 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 19:05:54,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:05:54 BoogieIcfgContainer [2019-01-01 19:05:54,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:05:54,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:05:54,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:05:54,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:05:54,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:05:52" (1/3) ... [2019-01-01 19:05:54,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7713b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:05:54, skipping insertion in model container [2019-01-01 19:05:54,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:05:53" (2/3) ... [2019-01-01 19:05:54,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7713b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:05:54, skipping insertion in model container [2019-01-01 19:05:54,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:05:54" (3/3) ... [2019-01-01 19:05:54,534 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-01 19:05:54,545 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:05:54,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-01-01 19:05:54,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-01-01 19:05:54,601 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:05:54,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:05:54,603 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:05:54,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:05:54,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:05:54,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:05:54,603 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:05:54,603 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:05:54,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:05:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-01-01 19:05:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 19:05:54,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:54,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:54,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash -250439764, now seen corresponding path program 1 times [2019-01-01 19:05:54,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:54,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:54,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:54,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:54,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:54,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:05:54,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:05:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:05:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:54,876 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2019-01-01 19:05:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:55,529 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-01-01 19:05:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:05:55,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 19:05:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:55,545 INFO L225 Difference]: With dead ends: 119 [2019-01-01 19:05:55,547 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 19:05:55,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 19:05:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-01-01 19:05:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:05:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-01-01 19:05:55,620 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 7 [2019-01-01 19:05:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:55,621 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-01-01 19:05:55,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:05:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-01-01 19:05:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 19:05:55,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:55,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:55,624 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -250439763, now seen corresponding path program 1 times [2019-01-01 19:05:55,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:55,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:55,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:55,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:55,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:55,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:05:55,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:05:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:05:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:55,716 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 3 states. [2019-01-01 19:05:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:55,956 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-01-01 19:05:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:05:55,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 19:05:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:55,960 INFO L225 Difference]: With dead ends: 129 [2019-01-01 19:05:55,960 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 19:05:55,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:05:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 19:05:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2019-01-01 19:05:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 19:05:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-01-01 19:05:55,973 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2019-01-01 19:05:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:55,974 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-01-01 19:05:55,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:05:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-01-01 19:05:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:05:55,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:55,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:55,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744574, now seen corresponding path program 1 times [2019-01-01 19:05:55,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:55,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:56,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 19:05:56,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:05:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:05:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:05:56,114 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 4 states. [2019-01-01 19:05:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:56,480 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-01-01 19:05:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:05:56,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-01 19:05:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:56,483 INFO L225 Difference]: With dead ends: 123 [2019-01-01 19:05:56,484 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 19:05:56,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 19:05:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2019-01-01 19:05:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:05:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-01-01 19:05:56,495 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2019-01-01 19:05:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:56,495 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-01-01 19:05:56,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:05:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-01-01 19:05:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:05:56,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:56,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:56,497 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744573, now seen corresponding path program 1 times [2019-01-01 19:05:56,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:56,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:56,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:56,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:56,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:05:56,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:05:56,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:05:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:05:56,703 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 7 states. [2019-01-01 19:05:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:57,141 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-01-01 19:05:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:05:57,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-01 19:05:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:57,144 INFO L225 Difference]: With dead ends: 140 [2019-01-01 19:05:57,144 INFO L226 Difference]: Without dead ends: 140 [2019-01-01 19:05:57,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:05:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-01 19:05:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2019-01-01 19:05:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 19:05:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-01-01 19:05:57,154 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2019-01-01 19:05:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:57,155 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-01-01 19:05:57,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:05:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-01-01 19:05:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 19:05:57,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:57,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:57,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625224, now seen corresponding path program 1 times [2019-01-01 19:05:57,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:57,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:57,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:57,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:05:57,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:05:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:05:57,255 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 6 states. [2019-01-01 19:05:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:57,978 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2019-01-01 19:05:57,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:05:57,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 19:05:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:57,981 INFO L225 Difference]: With dead ends: 191 [2019-01-01 19:05:57,981 INFO L226 Difference]: Without dead ends: 191 [2019-01-01 19:05:57,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:05:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-01 19:05:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 116. [2019-01-01 19:05:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 19:05:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-01-01 19:05:57,991 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 15 [2019-01-01 19:05:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:57,991 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-01-01 19:05:57,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:05:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-01-01 19:05:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 19:05:57,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:57,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:57,993 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625223, now seen corresponding path program 1 times [2019-01-01 19:05:57,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:57,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:57,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:57,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:58,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:58,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:58,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:05:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:05:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:05:58,116 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 6 states. [2019-01-01 19:05:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:58,612 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2019-01-01 19:05:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:05:58,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 19:05:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:58,615 INFO L225 Difference]: With dead ends: 194 [2019-01-01 19:05:58,616 INFO L226 Difference]: Without dead ends: 194 [2019-01-01 19:05:58,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:05:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-01 19:05:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 111. [2019-01-01 19:05:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:05:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-01-01 19:05:58,626 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 15 [2019-01-01 19:05:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:58,626 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-01-01 19:05:58,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:05:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-01-01 19:05:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 19:05:58,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:58,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:05:58,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash -584261800, now seen corresponding path program 1 times [2019-01-01 19:05:58,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:58,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:58,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:58,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:58,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:58,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:58,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:58,751 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 5 states. [2019-01-01 19:05:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:59,007 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2019-01-01 19:05:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:05:59,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 19:05:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:59,009 INFO L225 Difference]: With dead ends: 133 [2019-01-01 19:05:59,009 INFO L226 Difference]: Without dead ends: 133 [2019-01-01 19:05:59,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:05:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-01 19:05:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2019-01-01 19:05:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:05:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-01-01 19:05:59,018 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 21 [2019-01-01 19:05:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:59,020 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-01-01 19:05:59,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-01-01 19:05:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 19:05:59,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:59,022 INFO L402 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, 1] [2019-01-01 19:05:59,022 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1176305992, now seen corresponding path program 1 times [2019-01-01 19:05:59,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:59,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:59,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:59,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:59,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:05:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:05:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:05:59,193 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 5 states. [2019-01-01 19:05:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:59,454 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-01-01 19:05:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:05:59,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-01 19:05:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:59,457 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:05:59,457 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 19:05:59,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:05:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 19:05:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2019-01-01 19:05:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 19:05:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-01-01 19:05:59,464 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 23 [2019-01-01 19:05:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:59,465 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-01-01 19:05:59,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:05:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-01-01 19:05:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 19:05:59,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:59,466 INFO L402 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, 1] [2019-01-01 19:05:59,466 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:59,469 INFO L82 PathProgramCache]: Analyzing trace with hash -653023129, now seen corresponding path program 1 times [2019-01-01 19:05:59,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:59,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:59,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:59,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:59,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:05:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:05:59,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:05:59,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:05:59,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:05:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:05:59,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:05:59,565 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 6 states. [2019-01-01 19:05:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:05:59,956 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2019-01-01 19:05:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:05:59,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-01 19:05:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:05:59,959 INFO L225 Difference]: With dead ends: 178 [2019-01-01 19:05:59,960 INFO L226 Difference]: Without dead ends: 178 [2019-01-01 19:05:59,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:05:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-01 19:05:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 109. [2019-01-01 19:05:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 19:05:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-01 19:05:59,966 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 23 [2019-01-01 19:05:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:05:59,967 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-01 19:05:59,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:05:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-01 19:05:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 19:05:59,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:05:59,968 INFO L402 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, 1] [2019-01-01 19:05:59,968 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:05:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:05:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash -653023128, now seen corresponding path program 1 times [2019-01-01 19:05:59,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:05:59,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:05:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:05:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:05:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:00,273 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 19:06:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:06:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:06:00,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:06:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:06:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:06:00,293 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2019-01-01 19:06:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:01,231 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2019-01-01 19:06:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:06:01,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-01 19:06:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:01,237 INFO L225 Difference]: With dead ends: 194 [2019-01-01 19:06:01,237 INFO L226 Difference]: Without dead ends: 194 [2019-01-01 19:06:01,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:06:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-01 19:06:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 101. [2019-01-01 19:06:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 19:06:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-01 19:06:01,241 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 23 [2019-01-01 19:06:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:01,243 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-01 19:06:01,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:06:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-01 19:06:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 19:06:01,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:01,244 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:01,244 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash -562636110, now seen corresponding path program 1 times [2019-01-01 19:06:01,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:01,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:01,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:01,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:06:01,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:06:01,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:06:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:06:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:06:01,500 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2019-01-01 19:06:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:01,752 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-01-01 19:06:01,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:06:01,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-01 19:06:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:01,755 INFO L225 Difference]: With dead ends: 115 [2019-01-01 19:06:01,755 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 19:06:01,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:06:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 19:06:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-01 19:06:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:06:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-01 19:06:01,760 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 27 [2019-01-01 19:06:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:01,760 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-01 19:06:01,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:06:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-01 19:06:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:06:01,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:01,762 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:01,762 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash -140383124, now seen corresponding path program 1 times [2019-01-01 19:06:01,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:01,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:01,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:02,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:02,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:02,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:02,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:02,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:02,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 19:06:02,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-01 19:06:02,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:02,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:02,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-01-01 19:06:02,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:02,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 19:06:02,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:02,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-01 19:06:02,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2019-01-01 19:06:02,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:02,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 19:06:02,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:02,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:02,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-01-01 19:06:03,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2019-01-01 19:06:03,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-01 19:06:03,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:03,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:03,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:03,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:03,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:03,194 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-01-01 19:06:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-01 19:06:03,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 19:06:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 19:06:03,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:06:03,397 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 22 states. [2019-01-01 19:06:03,630 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-01 19:06:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:05,047 INFO L93 Difference]: Finished difference Result 198 states and 211 transitions. [2019-01-01 19:06:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 19:06:05,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-01-01 19:06:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:05,050 INFO L225 Difference]: With dead ends: 198 [2019-01-01 19:06:05,051 INFO L226 Difference]: Without dead ends: 198 [2019-01-01 19:06:05,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2019-01-01 19:06:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-01 19:06:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2019-01-01 19:06:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-01 19:06:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2019-01-01 19:06:05,057 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 36 [2019-01-01 19:06:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:05,057 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2019-01-01 19:06:05,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 19:06:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2019-01-01 19:06:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:06:05,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:05,061 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:05,063 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -140383123, now seen corresponding path program 1 times [2019-01-01 19:06:05,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:05,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:05,474 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-01 19:06:05,676 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 19:06:05,895 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-01-01 19:06:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:06,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:06,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:06,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:06,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:06,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:06:06,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:06,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:06,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:06,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-01 19:06:06,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:06,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:06,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:06,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:06,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-01-01 19:06:06,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:06,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 19:06:06,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:06,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:06,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-01 19:06:06,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 19:06:06,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-01-01 19:06:06,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2019-01-01 19:06:06,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:06,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 19:06:06,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-01-01 19:06:06,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:06,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 19:06:06,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:06,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-01-01 19:06:06,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2019-01-01 19:06:06,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-01 19:06:06,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:06,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-01 19:06:06,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:06,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 19:06:06,865 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:06,873 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-01-01 19:06:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:06,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:06,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2019-01-01 19:06:06,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 19:06:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 19:06:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-01 19:06:06,918 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 17 states. [2019-01-01 19:06:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:08,436 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-01-01 19:06:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 19:06:08,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-01-01 19:06:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:08,439 INFO L225 Difference]: With dead ends: 203 [2019-01-01 19:06:08,439 INFO L226 Difference]: Without dead ends: 203 [2019-01-01 19:06:08,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2019-01-01 19:06:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-01 19:06:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2019-01-01 19:06:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-01 19:06:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-01-01 19:06:08,450 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 36 [2019-01-01 19:06:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:08,450 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-01-01 19:06:08,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 19:06:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-01-01 19:06:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 19:06:08,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:08,452 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:08,455 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:08,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1764205122, now seen corresponding path program 1 times [2019-01-01 19:06:08,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:08,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:08,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:06:08,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:06:08,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:06:08,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:06:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:06:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:06:08,539 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 6 states. [2019-01-01 19:06:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:08,718 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-01-01 19:06:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:06:08,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-01 19:06:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:08,720 INFO L225 Difference]: With dead ends: 94 [2019-01-01 19:06:08,720 INFO L226 Difference]: Without dead ends: 94 [2019-01-01 19:06:08,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:06:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-01 19:06:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-01-01 19:06:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 19:06:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-01-01 19:06:08,725 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 38 [2019-01-01 19:06:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:08,725 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-01-01 19:06:08,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:06:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-01-01 19:06:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 19:06:08,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:08,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:08,730 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1122139694, now seen corresponding path program 1 times [2019-01-01 19:06:08,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:08,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:08,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:09,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:09,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:09,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:09,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:09,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:06:09,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:09,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:09,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:09,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:09,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-01 19:06:10,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:10,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:10,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:10,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:10,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-01-01 19:06:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:10,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 19:06:10,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:10,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:10,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-01 19:06:10,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 19:06:10,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2019-01-01 19:06:10,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2019-01-01 19:06:10,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2019-01-01 19:06:10,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:10,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 19:06:10,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2019-01-01 19:06:10,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-01 19:06:10,610 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,612 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-01-01 19:06:10,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:10,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 19:06:10,645 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,654 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:10,670 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2019-01-01 19:06:10,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2019-01-01 19:06:10,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2019-01-01 19:06:10,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:10,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-01 19:06:10,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:10,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 19:06:10,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:10,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:10,920 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2019-01-01 19:06:10,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 19:06:10,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 19:06:10,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:06:11,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:11,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:11,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2019-01-01 19:06:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:11,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:11,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2019-01-01 19:06:11,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 19:06:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 19:06:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-01-01 19:06:11,145 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 32 states. [2019-01-01 19:06:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:14,297 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-01-01 19:06:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 19:06:14,298 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-01-01 19:06:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:14,299 INFO L225 Difference]: With dead ends: 125 [2019-01-01 19:06:14,299 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 19:06:14,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=337, Invalid=2014, Unknown=1, NotChecked=0, Total=2352 [2019-01-01 19:06:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 19:06:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2019-01-01 19:06:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-01 19:06:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-01-01 19:06:14,304 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 40 [2019-01-01 19:06:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:14,304 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-01-01 19:06:14,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 19:06:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-01-01 19:06:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 19:06:14,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:14,305 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:14,306 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153555, now seen corresponding path program 1 times [2019-01-01 19:06:14,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:14,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:14,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:14,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:14,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:14,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:14,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:15,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-01 19:06:15,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:15,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:15,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:15,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:15,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-01-01 19:06:15,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-01 19:06:15,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:06:15,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-01 19:06:15,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-01 19:06:15,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:59 [2019-01-01 19:06:15,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-01 19:06:15,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2019-01-01 19:06:15,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2019-01-01 19:06:15,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-01-01 19:06:15,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2019-01-01 19:06:15,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:06:15,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2019-01-01 19:06:15,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:15,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2019-01-01 19:06:15,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-01 19:06:15,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:15,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-01 19:06:15,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-01-01 19:06:15,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:66 [2019-01-01 19:06:15,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 89 [2019-01-01 19:06:15,783 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:15,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2019-01-01 19:06:15,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2019-01-01 19:06:15,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:15,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 115 [2019-01-01 19:06:15,988 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:16,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 103 [2019-01-01 19:06:16,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:16,290 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:16,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2019-01-01 19:06:16,294 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:16,419 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:16,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 86 [2019-01-01 19:06:16,422 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:16,761 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-01 19:06:16,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-01 19:06:16,900 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:100, output treesize:413 [2019-01-01 19:06:17,139 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-01-01 19:06:17,418 INFO L303 Elim1Store]: Index analysis took 270 ms [2019-01-01 19:06:17,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 194 [2019-01-01 19:06:17,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:17,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 183 [2019-01-01 19:06:17,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 138 [2019-01-01 19:06:18,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:18,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 140 [2019-01-01 19:06:18,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 116 [2019-01-01 19:06:18,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:18,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-01-01 19:06:18,727 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2019-01-01 19:06:18,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:18,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2019-01-01 19:06:18,894 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:18,988 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73 [2019-01-01 19:06:19,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:19,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 80 [2019-01-01 19:06:19,106 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,124 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 86 [2019-01-01 19:06:19,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:19,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2019-01-01 19:06:19,208 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,223 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:06:19,279 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:450, output treesize:216 [2019-01-01 19:06:19,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 100 [2019-01-01 19:06:19,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2019-01-01 19:06:19,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2019-01-01 19:06:19,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:19,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2019-01-01 19:06:19,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2019-01-01 19:06:20,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-01-01 19:06:20,130 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-01 19:06:20,179 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2019-01-01 19:06:20,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:06:20,274 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-01 19:06:20,292 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,306 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:06:20,356 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:258, output treesize:133 [2019-01-01 19:06:20,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:20,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:20,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2019-01-01 19:06:20,570 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2019-01-01 19:06:20,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-01 19:06:20,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:20,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:20,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2019-01-01 19:06:20,641 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2019-01-01 19:06:20,643 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:06:20,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2019-01-01 19:06:20,688 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-01-01 19:06:20,718 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-01 19:06:20,748 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:20,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2019-01-01 19:06:20,778 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:20,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:06:20,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 19:06:20,838 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:90, output treesize:41 [2019-01-01 19:06:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:20,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:20,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2019-01-01 19:06:20,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-01 19:06:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-01 19:06:20,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 19:06:20,955 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 35 states. [2019-01-01 19:06:21,768 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 39 [2019-01-01 19:06:22,161 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2019-01-01 19:06:22,561 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2019-01-01 19:06:22,927 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2019-01-01 19:06:23,455 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 68 [2019-01-01 19:06:23,784 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 49 [2019-01-01 19:06:24,064 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 54 [2019-01-01 19:06:24,265 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-01 19:06:24,474 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-01-01 19:06:24,693 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-01-01 19:06:24,882 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-01 19:06:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:25,135 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2019-01-01 19:06:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 19:06:25,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-01-01 19:06:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:25,138 INFO L225 Difference]: With dead ends: 159 [2019-01-01 19:06:25,138 INFO L226 Difference]: Without dead ends: 159 [2019-01-01 19:06:25,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=485, Invalid=2937, Unknown=0, NotChecked=0, Total=3422 [2019-01-01 19:06:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-01 19:06:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2019-01-01 19:06:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 19:06:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-01-01 19:06:25,143 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 42 [2019-01-01 19:06:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:25,144 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-01-01 19:06:25,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-01 19:06:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-01-01 19:06:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 19:06:25,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:25,149 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:25,149 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153556, now seen corresponding path program 1 times [2019-01-01 19:06:25,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:25,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:25,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:25,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:25,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:25,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:06:25,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:25,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:25,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:25,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:25,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:25,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-01-01 19:06:25,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:25,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:25,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:26,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:26,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:26,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:26,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:26,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:26,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:26,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-01-01 19:06:27,134 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 19:06:27,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 19:06:27,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-01 19:06:27,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-01-01 19:06:27,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:06:27,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:73 [2019-01-01 19:06:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-01 19:06:27,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-01-01 19:06:27,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-01 19:06:27,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2019-01-01 19:06:27,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:73 [2019-01-01 19:06:27,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-01 19:06:27,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:27,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:77 [2019-01-01 19:06:27,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2019-01-01 19:06:27,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-01-01 19:06:27,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-01 19:06:27,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-01-01 19:06:27,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:27,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:59 [2019-01-01 19:06:27,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:27,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 84 [2019-01-01 19:06:27,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2019-01-01 19:06:27,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 47 [2019-01-01 19:06:28,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:06:28,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:28,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2019-01-01 19:06:28,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:06:28,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 84 [2019-01-01 19:06:28,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:28,245 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:28,307 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:90, output treesize:143 [2019-01-01 19:06:28,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 123 [2019-01-01 19:06:28,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-01-01 19:06:28,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 175 [2019-01-01 19:06:28,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-01 19:06:28,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2019-01-01 19:06:28,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-01-01 19:06:28,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 122 [2019-01-01 19:06:28,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 99 [2019-01-01 19:06:28,761 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-01 19:06:28,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:28,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 97 [2019-01-01 19:06:28,874 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:28,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:28,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 19:06:28,993 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:338, output treesize:212 [2019-01-01 19:06:29,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:29,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 89 [2019-01-01 19:06:29,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2019-01-01 19:06:29,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:06:29,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2019-01-01 19:06:29,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2019-01-01 19:06:29,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2019-01-01 19:06:29,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2019-01-01 19:06:29,549 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2019-01-01 19:06:29,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:29,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:06:29,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2019-01-01 19:06:29,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-01 19:06:29,832 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2019-01-01 19:06:29,847 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,858 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-01-01 19:06:29,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-01 19:06:29,955 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:06:29,968 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:29,979 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-01 19:06:30,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-01 19:06:30,070 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:30,086 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,099 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2019-01-01 19:06:30,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:30,108 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2019-01-01 19:06:30,123 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,131 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2019-01-01 19:06:30,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:30,139 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 19:06:30,154 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,166 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-01 19:06:30,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 19:06:30,252 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 19:06:30,265 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,272 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-01-01 19:06:30,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-01 19:06:30,338 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:06:30,348 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,354 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:30,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 19:06:30,405 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 10 variables, input treesize:245, output treesize:56 [2019-01-01 19:06:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:30,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:30,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-01-01 19:06:30,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 19:06:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 19:06:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2019-01-01 19:06:30,464 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 32 states. [2019-01-01 19:06:31,275 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-01-01 19:06:31,913 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-01 19:06:32,393 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2019-01-01 19:06:32,562 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 19:06:32,812 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-01-01 19:06:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:33,068 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2019-01-01 19:06:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 19:06:33,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-01-01 19:06:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:33,073 INFO L225 Difference]: With dead ends: 153 [2019-01-01 19:06:33,073 INFO L226 Difference]: Without dead ends: 153 [2019-01-01 19:06:33,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 19:06:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-01 19:06:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-01 19:06:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:06:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-01-01 19:06:33,078 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 42 [2019-01-01 19:06:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:33,083 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-01-01 19:06:33,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 19:06:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-01-01 19:06:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:06:33,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:33,084 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:33,085 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash -792234856, now seen corresponding path program 2 times [2019-01-01 19:06:33,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:33,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:33,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:33,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:33,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:06:33,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:06:33,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:06:33,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:33,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:33,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:33,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:33,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-01 19:06:33,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:33,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:33,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:33,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:33,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-01-01 19:06:33,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:33,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-01 19:06:33,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:06:33,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:33,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-01 19:06:33,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-01 19:06:33,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2019-01-01 19:06:33,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2019-01-01 19:06:33,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:33,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-01-01 19:06:33,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2019-01-01 19:06:33,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:33,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-01-01 19:06:33,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:33,942 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2019-01-01 19:06:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:34,134 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:34,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2019-01-01 19:06:34,150 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:34,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2019-01-01 19:06:34,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:34,163 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:34,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2019-01-01 19:06:34,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:34,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:34,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-01 19:06:34,226 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:34,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-01-01 19:06:34,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:34,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 19:06:34,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:34,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:34,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:34,253 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2019-01-01 19:06:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:34,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:34,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-01-01 19:06:34,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 19:06:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 19:06:34,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=722, Unknown=3, NotChecked=0, Total=812 [2019-01-01 19:06:34,328 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 29 states. [2019-01-01 19:06:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:35,778 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-01-01 19:06:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:06:35,779 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-01 19:06:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:35,781 INFO L225 Difference]: With dead ends: 124 [2019-01-01 19:06:35,781 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:06:35,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=1273, Unknown=4, NotChecked=0, Total=1482 [2019-01-01 19:06:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:06:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-01-01 19:06:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:06:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-01-01 19:06:35,785 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2019-01-01 19:06:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:35,785 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-01-01 19:06:35,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 19:06:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-01-01 19:06:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:06:35,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:35,786 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:35,786 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442674, now seen corresponding path program 3 times [2019-01-01 19:06:35,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:35,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:35,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:06:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:36,113 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-01 19:06:36,360 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 19:06:36,623 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-01 19:06:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:36,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:36,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:06:36,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 19:06:36,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:06:36,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:36,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:36,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:36,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:36,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:36,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:36,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-01 19:06:36,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:36,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:36,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:36,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:36,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:36,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-01-01 19:06:37,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-01 19:06:37,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:37,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-01-01 19:06:37,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-01 19:06:37,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-01 19:06:37,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2019-01-01 19:06:37,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:06:37,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-01-01 19:06:37,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-01 19:06:37,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-01 19:06:37,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2019-01-01 19:06:37,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2019-01-01 19:06:37,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2019-01-01 19:06:37,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:37,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2019-01-01 19:06:37,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:06:37,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:37,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:06:37,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:83 [2019-01-01 19:06:37,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2019-01-01 19:06:37,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 73 [2019-01-01 19:06:37,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:06:37,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:37,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2019-01-01 19:06:37,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:06:38,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2019-01-01 19:06:38,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:38,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 19:06:38,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-01-01 19:06:38,112 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2019-01-01 19:06:38,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2019-01-01 19:06:38,570 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:38,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2019-01-01 19:06:38,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-01-01 19:06:38,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-01 19:06:38,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2019-01-01 19:06:38,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:38,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,680 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:38,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-01-01 19:06:38,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:38,702 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2019-01-01 19:06:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:38,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:38,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2019-01-01 19:06:38,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 19:06:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 19:06:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2019-01-01 19:06:38,751 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2019-01-01 19:06:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:41,020 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-01-01 19:06:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 19:06:41,021 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-01-01 19:06:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:41,023 INFO L225 Difference]: With dead ends: 161 [2019-01-01 19:06:41,023 INFO L226 Difference]: Without dead ends: 161 [2019-01-01 19:06:41,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=368, Invalid=2077, Unknown=5, NotChecked=0, Total=2450 [2019-01-01 19:06:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-01 19:06:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2019-01-01 19:06:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 19:06:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-01-01 19:06:41,028 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2019-01-01 19:06:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:41,029 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-01-01 19:06:41,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 19:06:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-01-01 19:06:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:06:41,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:41,030 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:41,030 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442675, now seen corresponding path program 2 times [2019-01-01 19:06:41,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:41,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:41,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:41,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:06:41,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:41,619 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-01-01 19:06:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:41,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:41,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:41,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:06:41,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:06:41,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:06:41,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:41,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:06:41,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:41,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 19:06:41,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-01-01 19:06:41,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:41,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:41,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:41,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:41,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:41,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2019-01-01 19:06:42,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2019-01-01 19:06:42,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:42,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-01 19:06:42,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 19:06:42,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2019-01-01 19:06:42,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2019-01-01 19:06:42,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-01 19:06:42,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2019-01-01 19:06:42,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-01 19:06:42,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:67 [2019-01-01 19:06:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-01-01 19:06:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 19:06:42,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2019-01-01 19:06:42,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-01 19:06:42,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2019-01-01 19:06:42,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2019-01-01 19:06:42,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-01 19:06:42,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:64 [2019-01-01 19:06:42,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2019-01-01 19:06:42,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-01 19:06:42,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:42,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2019-01-01 19:06:42,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:42,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:42,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:43,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2019-01-01 19:06:43,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2019-01-01 19:06:43,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:43,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-01-01 19:06:43,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 97 [2019-01-01 19:06:43,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:43,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-01-01 19:06:43,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:43,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:185, output treesize:99 [2019-01-01 19:06:43,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 64 [2019-01-01 19:06:43,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:43,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-01-01 19:06:43,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:43,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-01-01 19:06:43,392 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:43,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:43,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-01 19:06:43,433 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:43,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 19:06:43,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:43,443 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:43,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:43,462 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:116, output treesize:18 [2019-01-01 19:06:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:43,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:43,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-01-01 19:06:43,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 19:06:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 19:06:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=974, Unknown=1, NotChecked=0, Total=1122 [2019-01-01 19:06:43,571 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 34 states. [2019-01-01 19:06:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:45,836 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-01-01 19:06:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 19:06:45,838 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-01-01 19:06:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:45,840 INFO L225 Difference]: With dead ends: 166 [2019-01-01 19:06:45,840 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 19:06:45,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=350, Invalid=2001, Unknown=1, NotChecked=0, Total=2352 [2019-01-01 19:06:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 19:06:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2019-01-01 19:06:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:06:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-01-01 19:06:45,847 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2019-01-01 19:06:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:45,848 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-01-01 19:06:45,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 19:06:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-01-01 19:06:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 19:06:45,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:45,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:45,849 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324651, now seen corresponding path program 1 times [2019-01-01 19:06:45,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:45,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:45,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:06:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:46,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:46,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:46,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:46,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:46,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:46,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 19:06:46,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-01-01 19:06:46,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:46,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:46,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:46,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:46,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-01-01 19:06:46,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:46,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 19:06:46,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-01 19:06:46,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:46,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-01-01 19:06:47,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:06:47,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2019-01-01 19:06:47,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-01 19:06:47,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-01-01 19:06:47,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-01 19:06:47,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2019-01-01 19:06:47,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2019-01-01 19:06:47,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2019-01-01 19:06:47,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2019-01-01 19:06:47,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-01 19:06:47,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-01-01 19:06:47,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-01 19:06:47,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-01-01 19:06:47,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2019-01-01 19:06:47,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2019-01-01 19:06:47,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:47,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2019-01-01 19:06:47,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:47,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:47,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:100 [2019-01-01 19:06:47,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 164 [2019-01-01 19:06:47,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:47,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-01 19:06:47,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 128 [2019-01-01 19:06:48,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:48,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-01 19:06:48,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:48,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2019-01-01 19:06:48,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2019-01-01 19:06:48,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:48,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2019-01-01 19:06:48,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:48,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2019-01-01 19:06:48,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2019-01-01 19:06:48,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-01 19:06:48,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:48,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-01 19:06:48,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:48,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:48,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:48,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:48,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2019-01-01 19:06:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:48,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:48,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-01-01 19:06:48,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 19:06:48,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 19:06:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 19:06:48,747 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2019-01-01 19:06:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:51,014 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-01-01 19:06:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 19:06:51,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2019-01-01 19:06:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:51,017 INFO L225 Difference]: With dead ends: 164 [2019-01-01 19:06:51,017 INFO L226 Difference]: Without dead ends: 164 [2019-01-01 19:06:51,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 19:06:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-01 19:06:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2019-01-01 19:06:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 19:06:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2019-01-01 19:06:51,023 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2019-01-01 19:06:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:51,023 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2019-01-01 19:06:51,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 19:06:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2019-01-01 19:06:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 19:06:51,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:51,024 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:51,024 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324650, now seen corresponding path program 1 times [2019-01-01 19:06:51,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:51,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:51,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:06:51,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:06:51,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:06:51,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:06:51,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:51,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:51,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 19:06:51,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-01 19:06:51,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:51,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:51,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:06:51,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:51,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-01 19:06:51,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 19:06:51,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-01 19:06:51,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2019-01-01 19:06:51,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:06:51,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2019-01-01 19:06:51,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-01 19:06:51,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:51,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2019-01-01 19:06:51,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:51,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-01 19:06:52,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-01-01 19:06:52,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:55 [2019-01-01 19:06:52,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 19:06:52,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:06:52,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-01-01 19:06:52,142 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:06:52,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 60 [2019-01-01 19:06:52,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-01 19:06:52,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-01 19:06:52,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-01-01 19:06:52,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2019-01-01 19:06:52,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2019-01-01 19:06:52,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:52,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 103 [2019-01-01 19:06:52,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:06:52,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:94 [2019-01-01 19:06:52,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 199 [2019-01-01 19:06:52,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-01 19:06:52,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2019-01-01 19:06:52,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:06:52,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-01 19:06:52,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:52,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:52,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2019-01-01 19:06:53,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2019-01-01 19:06:53,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:53,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:53,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2019-01-01 19:06:53,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:53,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-01 19:06:53,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:53,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:06:53,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-01-01 19:06:53,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:06:53,095 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:53,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-01 19:06:53,104 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:06:53,108 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:53,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:06:53,115 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2019-01-01 19:06:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:06:53,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:06:53,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2019-01-01 19:06:53,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 19:06:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 19:06:53,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-01-01 19:06:53,154 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 32 states. [2019-01-01 19:06:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:06:55,504 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2019-01-01 19:06:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 19:06:55,508 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2019-01-01 19:06:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:06:55,509 INFO L225 Difference]: With dead ends: 162 [2019-01-01 19:06:55,509 INFO L226 Difference]: Without dead ends: 162 [2019-01-01 19:06:55,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 19:06:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-01 19:06:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2019-01-01 19:06:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 19:06:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-01-01 19:06:55,519 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2019-01-01 19:06:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:06:55,520 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-01-01 19:06:55,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 19:06:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2019-01-01 19:06:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:06:55,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:06:55,524 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:06:55,524 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-01-01 19:06:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:06:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1876553957, now seen corresponding path program 1 times [2019-01-01 19:06:55,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:06:55,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:06:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:06:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:06:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:06:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:06:55,625 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 19:06:55,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:06:55 BoogieIcfgContainer [2019-01-01 19:06:55,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:06:55,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:06:55,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:06:55,702 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:06:55,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:05:54" (3/4) ... [2019-01-01 19:06:55,707 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 19:06:55,762 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:06:55,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:06:55,763 INFO L168 Benchmark]: Toolchain (without parser) took 63418.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 952.7 MB in the beginning and 906.9 MB in the end (delta: 45.8 MB). Peak memory consumption was 559.1 MB. Max. memory is 11.5 GB. [2019-01-01 19:06:55,766 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:06:55,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-01 19:06:55,766 INFO L168 Benchmark]: Boogie Preprocessor took 114.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:06:55,766 INFO L168 Benchmark]: RCFGBuilder took 1258.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:06:55,770 INFO L168 Benchmark]: TraceAbstraction took 61174.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 906.9 MB in the end (delta: 157.2 MB). Peak memory consumption was 524.8 MB. Max. memory is 11.5 GB. [2019-01-01 19:06:55,772 INFO L168 Benchmark]: Witness Printer took 63.12 ms. Allocated memory is still 1.5 GB. Free memory is still 906.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:06:55,775 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 802.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1258.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61174.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 906.9 MB in the end (delta: 157.2 MB). Peak memory consumption was 524.8 MB. Max. memory is 11.5 GB. * Witness Printer took 63.12 ms. Allocated memory is still 1.5 GB. Free memory is still 906.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L996] list->next = ((void*)0) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L997] list->colour = BLACK VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L999] SLL* end = list; VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1006] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1017] EXPR end->next VAL [end={-1:0}, end->next={3:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={3:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1019] end->colour = BLACK VAL [end={3:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1028] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1032] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1032] EXPR end->colour VAL [end={-1:0}, end->colour=0, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={-1:0}, end->next={3:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={3:0}, end->next={0:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 52 error locations. UNSAFE Result, 61.1s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 29.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1283 SDtfs, 4676 SDslu, 5806 SDs, 0 SdLazy, 12252 SolverSat, 939 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 295 SyntacticMatches, 33 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 869 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1035 ConstructedInterpolants, 175 QuantifiedInterpolants, 1343794 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1942 ConjunctsInSsa, 510 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...