./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eed6d14b3659ee573ecc9a025ea4a6cd48efa35c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:59:40,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:59:40,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:59:40,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:59:40,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:59:40,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:59:40,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:59:40,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:59:40,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:59:40,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:59:40,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:59:40,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:59:40,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:59:40,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:59:40,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:59:40,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:59:40,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:59:40,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:59:40,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:59:40,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:59:40,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:59:40,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:59:40,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:59:40,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:59:40,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:59:40,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:59:40,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:59:40,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:59:40,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:59:40,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:59:40,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:59:40,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:59:40,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:59:40,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:59:40,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:59:40,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:59:40,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:59:40,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:59:40,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:59:40,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:59:40,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:59:40,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:59:40,461 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:59:40,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:59:40,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:59:40,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:59:40,464 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:59:40,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:59:40,465 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:59:40,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:59:40,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:59:40,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:59:40,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:59:40,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:59:40,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:59:40,468 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:59:40,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:59:40,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:59:40,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:59:40,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:59:40,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:59:40,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:59:40,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:59:40,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:59:40,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:59:40,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:59:40,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:59:40,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:59:40,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:59:40,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:59:40,472 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:59:40,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 ! call(__VERIFIER_error())) ) 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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2019-11-28 16:59:40,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:59:40,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:59:40,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:59:40,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:59:40,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:59:40,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-28 16:59:41,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf944386c/a51296b4bbc34cc89ae09f0d7f3bd1dc/FLAG7dceec672 [2019-11-28 16:59:41,542 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:59:41,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-28 16:59:41,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf944386c/a51296b4bbc34cc89ae09f0d7f3bd1dc/FLAG7dceec672 [2019-11-28 16:59:41,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf944386c/a51296b4bbc34cc89ae09f0d7f3bd1dc [2019-11-28 16:59:41,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:59:41,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:59:41,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:59:41,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:59:41,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:59:41,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:59:41" (1/1) ... [2019-11-28 16:59:41,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1731b3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:41, skipping insertion in model container [2019-11-28 16:59:41,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:59:41" (1/1) ... [2019-11-28 16:59:41,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:59:41,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:59:42,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:59:42,426 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:59:42,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:59:42,551 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:59:42,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42 WrapperNode [2019-11-28 16:59:42,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:59:42,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:59:42,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:59:42,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:59:42,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:59:42,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:59:42,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:59:42,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:59:42,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (1/1) ... [2019-11-28 16:59:42,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:59:42,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:59:42,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:59:42,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:59:42,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (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-11-28 16:59:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:59:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:59:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:59:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:59:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:59:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:59:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:59:42,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:59:43,299 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:59:43,299 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 16:59:43,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:59:43 BoogieIcfgContainer [2019-11-28 16:59:43,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:59:43,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:59:43,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:59:43,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:59:43,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:59:41" (1/3) ... [2019-11-28 16:59:43,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c70814f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:59:43, skipping insertion in model container [2019-11-28 16:59:43,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:59:42" (2/3) ... [2019-11-28 16:59:43,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c70814f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:59:43, skipping insertion in model container [2019-11-28 16:59:43,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:59:43" (3/3) ... [2019-11-28 16:59:43,310 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2019-11-28 16:59:43,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:59:43,329 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:59:43,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:59:43,362 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:59:43,362 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:59:43,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:59:43,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:59:43,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:59:43,363 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:59:43,363 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:59:43,363 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:59:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-28 16:59:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:59:43,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:43,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:43,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:43,390 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2019-11-28 16:59:43,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:43,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342137883] [2019-11-28 16:59:43,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:43,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342137883] [2019-11-28 16:59:43,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:43,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:59:43,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624515246] [2019-11-28 16:59:43,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:59:43,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:43,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:59:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:59:43,560 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-11-28 16:59:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:43,585 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-11-28 16:59:43,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:59:43,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 16:59:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:43,597 INFO L225 Difference]: With dead ends: 98 [2019-11-28 16:59:43,597 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 16:59:43,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:59:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 16:59:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 16:59:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 16:59:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-11-28 16:59:43,635 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2019-11-28 16:59:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:43,635 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-11-28 16:59:43,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:59:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-11-28 16:59:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:59:43,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:43,637 INFO L410 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-11-28 16:59:43,637 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2019-11-28 16:59:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:43,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762958533] [2019-11-28 16:59:43,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:43,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762958533] [2019-11-28 16:59:43,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:43,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:43,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916363746] [2019-11-28 16:59:43,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:43,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:43,743 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-11-28 16:59:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:43,777 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-28 16:59:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:43,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 16:59:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:43,784 INFO L225 Difference]: With dead ends: 71 [2019-11-28 16:59:43,784 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 16:59:43,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 16:59:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 16:59:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 16:59:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-28 16:59:43,808 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2019-11-28 16:59:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:43,809 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-28 16:59:43,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-28 16:59:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:59:43,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:43,815 INFO L410 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, 1, 1, 1, 1] [2019-11-28 16:59:43,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2019-11-28 16:59:43,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:43,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502785328] [2019-11-28 16:59:43,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:43,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502785328] [2019-11-28 16:59:43,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:43,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:43,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891947184] [2019-11-28 16:59:43,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:43,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:43,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:43,886 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2019-11-28 16:59:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:43,918 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-28 16:59:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:43,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 16:59:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:43,923 INFO L225 Difference]: With dead ends: 89 [2019-11-28 16:59:43,923 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 16:59:43,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 16:59:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 16:59:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 16:59:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2019-11-28 16:59:43,939 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2019-11-28 16:59:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:43,943 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2019-11-28 16:59:43,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2019-11-28 16:59:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:59:43,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:43,944 INFO L410 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, 1, 1, 1, 1] [2019-11-28 16:59:43,946 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2019-11-28 16:59:43,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:43,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686184170] [2019-11-28 16:59:43,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:44,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686184170] [2019-11-28 16:59:44,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:44,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:59:44,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115115730] [2019-11-28 16:59:44,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:59:44,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:59:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:44,059 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2019-11-28 16:59:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:44,265 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-11-28 16:59:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:59:44,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 16:59:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:44,271 INFO L225 Difference]: With dead ends: 78 [2019-11-28 16:59:44,271 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 16:59:44,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:59:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 16:59:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-11-28 16:59:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 16:59:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2019-11-28 16:59:44,289 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2019-11-28 16:59:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:44,290 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2019-11-28 16:59:44,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:59:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2019-11-28 16:59:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:59:44,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:44,293 INFO L410 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] [2019-11-28 16:59:44,294 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2019-11-28 16:59:44,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:44,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923572795] [2019-11-28 16:59:44,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:44,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923572795] [2019-11-28 16:59:44,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:44,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:59:44,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600333107] [2019-11-28 16:59:44,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:59:44,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:44,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:59:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:44,432 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2019-11-28 16:59:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:44,568 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-28 16:59:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:59:44,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 16:59:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:44,570 INFO L225 Difference]: With dead ends: 80 [2019-11-28 16:59:44,571 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 16:59:44,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:59:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 16:59:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2019-11-28 16:59:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 16:59:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2019-11-28 16:59:44,580 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2019-11-28 16:59:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:44,581 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2019-11-28 16:59:44,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:59:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2019-11-28 16:59:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:59:44,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:44,583 INFO L410 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] [2019-11-28 16:59:44,584 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:44,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2019-11-28 16:59:44,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:44,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248504884] [2019-11-28 16:59:44,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:44,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248504884] [2019-11-28 16:59:44,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:44,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:59:44,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751097848] [2019-11-28 16:59:44,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:59:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:44,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:59:44,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:44,698 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2019-11-28 16:59:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:44,838 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-28 16:59:44,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:59:44,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 16:59:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:44,841 INFO L225 Difference]: With dead ends: 80 [2019-11-28 16:59:44,842 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 16:59:44,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:59:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 16:59:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2019-11-28 16:59:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 16:59:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-28 16:59:44,856 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2019-11-28 16:59:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:44,857 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-28 16:59:44,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:59:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-28 16:59:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 16:59:44,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:44,869 INFO L410 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] [2019-11-28 16:59:44,869 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:44,871 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2019-11-28 16:59:44,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:44,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607572996] [2019-11-28 16:59:44,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:45,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607572996] [2019-11-28 16:59:45,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707478089] [2019-11-28 16:59:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:45,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 16:59:45,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:45,243 INFO L377 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-11-28 16:59:45,248 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:59:45,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,292 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:45,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:45,313 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,325 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,326 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-28 16:59:45,352 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:45,353 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 16:59:45,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-28 16:59:45,387 INFO L377 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 19 treesize of output 18 [2019-11-28 16:59:45,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,396 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:45,396 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 16:59:45,444 INFO L377 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 10 [2019-11-28 16:59:45,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:45,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:45,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 16:59:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:45,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:45,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 16:59:45,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771412217] [2019-11-28 16:59:45,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:59:45,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:59:45,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:59:45,458 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 10 states. [2019-11-28 16:59:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:45,815 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-11-28 16:59:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:45,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-28 16:59:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:45,817 INFO L225 Difference]: With dead ends: 82 [2019-11-28 16:59:45,817 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 16:59:45,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:59:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 16:59:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-11-28 16:59:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 16:59:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-11-28 16:59:45,824 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 31 [2019-11-28 16:59:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:45,825 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-11-28 16:59:45,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:59:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-11-28 16:59:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 16:59:45,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:45,826 INFO L410 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] [2019-11-28 16:59:46,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:46,031 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2019-11-28 16:59:46,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:46,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038958176] [2019-11-28 16:59:46,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:46,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038958176] [2019-11-28 16:59:46,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908617506] [2019-11-28 16:59:46,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:46,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 16:59:46,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:46,272 INFO L377 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-11-28 16:59:46,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:59:46,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,297 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:46,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:46,313 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,324 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-28 16:59:46,343 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:46,344 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 16:59:46,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-28 16:59:46,378 INFO L377 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 19 treesize of output 18 [2019-11-28 16:59:46,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:46,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 16:59:46,447 INFO L377 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 10 [2019-11-28 16:59:46,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:46,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:46,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 16:59:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:46,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:46,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 16:59:46,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936307065] [2019-11-28 16:59:46,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:59:46,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:59:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:59:46,496 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 10 states. [2019-11-28 16:59:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:46,860 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2019-11-28 16:59:46,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:46,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-28 16:59:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:46,861 INFO L225 Difference]: With dead ends: 91 [2019-11-28 16:59:46,861 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 16:59:46,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:59:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 16:59:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-28 16:59:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 16:59:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-28 16:59:46,869 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2019-11-28 16:59:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:46,870 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-28 16:59:46,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:59:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-28 16:59:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 16:59:46,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:46,872 INFO L410 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] [2019-11-28 16:59:47,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:47,083 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -20007500, now seen corresponding path program 1 times [2019-11-28 16:59:47,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:47,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405430804] [2019-11-28 16:59:47,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:47,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405430804] [2019-11-28 16:59:47,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891225775] [2019-11-28 16:59:47,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:47,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 16:59:47,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:47,422 INFO L377 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-11-28 16:59:47,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,428 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:59:47,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,484 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:47,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-28 16:59:47,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-28 16:59:47,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,534 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-28 16:59:47,542 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,558 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-28 16:59:47,587 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-11-28 16:59:47,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 19 [2019-11-28 16:59:47,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,628 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,629 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-28 16:59:47,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:47,633 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,651 INFO L614 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-28 16:59:47,655 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-28 16:59:47,655 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,661 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-28 16:59:47,691 INFO L377 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 39 treesize of output 21 [2019-11-28 16:59:47,692 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2019-11-28 16:59:47,701 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,709 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-28 16:59:47,719 INFO L377 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 15 treesize of output 7 [2019-11-28 16:59:47,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:47,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:47,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 16:59:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:47,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:47,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-28 16:59:47,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057382029] [2019-11-28 16:59:47,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 16:59:47,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 16:59:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:59:47,727 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-28 16:59:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:48,275 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2019-11-28 16:59:48,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:48,276 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-11-28 16:59:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:48,277 INFO L225 Difference]: With dead ends: 95 [2019-11-28 16:59:48,277 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 16:59:48,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:59:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 16:59:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-28 16:59:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 16:59:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2019-11-28 16:59:48,299 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2019-11-28 16:59:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:48,300 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2019-11-28 16:59:48,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 16:59:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2019-11-28 16:59:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 16:59:48,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:48,305 INFO L410 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] [2019-11-28 16:59:48,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:48,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:48,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1998658321, now seen corresponding path program 1 times [2019-11-28 16:59:48,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:48,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988928947] [2019-11-28 16:59:48,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:48,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988928947] [2019-11-28 16:59:48,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494617337] [2019-11-28 16:59:48,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:48,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 16:59:48,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:48,794 INFO L377 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-11-28 16:59:48,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:59:48,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,841 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:48,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,849 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,849 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-28 16:59:48,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-28 16:59:48,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,892 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-28 16:59:48,898 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,912 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-28 16:59:48,939 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-11-28 16:59:48,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 19 [2019-11-28 16:59:48,944 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,956 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:48,975 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-28 16:59:48,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:48,977 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:48,995 INFO L614 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-28 16:59:48,999 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-28 16:59:49,000 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:49,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,007 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-28 16:59:49,036 INFO L377 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 39 treesize of output 21 [2019-11-28 16:59:49,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,044 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:49,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2019-11-28 16:59:49,050 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:49,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,056 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-28 16:59:49,060 INFO L377 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 15 treesize of output 7 [2019-11-28 16:59:49,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:49,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:49,064 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 16:59:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:49,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:49,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-28 16:59:49,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116597070] [2019-11-28 16:59:49,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 16:59:49,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 16:59:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:59:49,070 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 15 states. [2019-11-28 16:59:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:49,677 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-11-28 16:59:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:49,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-11-28 16:59:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:49,678 INFO L225 Difference]: With dead ends: 97 [2019-11-28 16:59:49,678 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 16:59:49,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:59:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 16:59:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-11-28 16:59:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 16:59:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-11-28 16:59:49,688 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-11-28 16:59:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:49,688 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-11-28 16:59:49,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 16:59:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-11-28 16:59:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 16:59:49,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:49,692 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-28 16:59:49,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:49,893 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:49,893 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 2 times [2019-11-28 16:59:49,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:49,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544992529] [2019-11-28 16:59:49,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:50,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544992529] [2019-11-28 16:59:50,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103330429] [2019-11-28 16:59:50,114 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:50,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:59:50,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:59:50,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 16:59:50,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:50,235 INFO L377 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-11-28 16:59:50,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,244 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:59:50,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,258 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:50,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-28 16:59:50,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:50,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:50,300 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,324 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-28 16:59:50,340 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2019-11-28 16:59:50,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 15 [2019-11-28 16:59:50,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,387 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-28 16:59:50,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:50,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,412 INFO L614 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-11-28 16:59:50,418 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-11-28 16:59:50,419 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,427 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-28 16:59:50,459 INFO L377 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 31 treesize of output 19 [2019-11-28 16:59:50,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2019-11-28 16:59:50,471 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,478 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-28 16:59:50,486 INFO L377 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 15 treesize of output 7 [2019-11-28 16:59:50,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:50,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:50,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 16:59:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:50,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:50,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 16:59:50,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447263608] [2019-11-28 16:59:50,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 16:59:50,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 16:59:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:59:50,494 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 11 states. [2019-11-28 16:59:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:50,908 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-11-28 16:59:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:50,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-28 16:59:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:50,909 INFO L225 Difference]: With dead ends: 90 [2019-11-28 16:59:50,910 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 16:59:50,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:59:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 16:59:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-11-28 16:59:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 16:59:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2019-11-28 16:59:50,917 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2019-11-28 16:59:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:50,917 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-11-28 16:59:50,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 16:59:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2019-11-28 16:59:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 16:59:50,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:50,918 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-28 16:59:51,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:51,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2019-11-28 16:59:51,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:51,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31450242] [2019-11-28 16:59:51,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:51,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31450242] [2019-11-28 16:59:51,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217265966] [2019-11-28 16:59:51,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:51,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:59:51,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:59:51,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-28 16:59:51,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:51,363 INFO L377 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-11-28 16:59:51,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:59:51,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,447 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:51,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,490 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-28 16:59:51,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:51,493 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,514 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-28 16:59:51,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:51,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2019-11-28 16:59:51,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-28 16:59:51,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 26 [2019-11-28 16:59:51,613 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 16:59:51,631 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,641 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-28 16:59:51,695 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:51,695 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 16:59:51,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:51,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-28 16:59:51,745 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-28 16:59:51,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:51,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:51,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:51,759 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-28 16:59:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:51,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:51,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-28 16:59:51,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365074630] [2019-11-28 16:59:51,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 16:59:51,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 16:59:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:59:51,849 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 18 states. [2019-11-28 16:59:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:52,681 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2019-11-28 16:59:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 16:59:52,681 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-28 16:59:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:52,682 INFO L225 Difference]: With dead ends: 109 [2019-11-28 16:59:52,682 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 16:59:52,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:59:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 16:59:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-11-28 16:59:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 16:59:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-11-28 16:59:52,689 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 35 [2019-11-28 16:59:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:52,690 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-11-28 16:59:52,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 16:59:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-11-28 16:59:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 16:59:52,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:52,691 INFO L410 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] [2019-11-28 16:59:52,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:52,895 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2019-11-28 16:59:52,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:52,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712669724] [2019-11-28 16:59:52,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:53,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712669724] [2019-11-28 16:59:53,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514228396] [2019-11-28 16:59:53,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:53,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 16:59:53,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:53,120 INFO L377 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-11-28 16:59:53,121 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:59:53,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,170 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:53,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,204 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-28 16:59:53,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:53,215 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,241 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-11-28 16:59:53,288 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:53,288 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 16:59:53,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-11-28 16:59:53,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 26 [2019-11-28 16:59:53,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 16:59:53,357 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,370 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-11-28 16:59:53,414 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:59:53,414 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 16:59:53,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:53,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2019-11-28 16:59:53,469 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-28 16:59:53,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:53,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-28 16:59:53,538 INFO L377 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 29 treesize of output 13 [2019-11-28 16:59:53,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:53,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:53,547 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-28 16:59:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:53,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:53,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-28 16:59:53,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505672574] [2019-11-28 16:59:53,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 16:59:53,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 16:59:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-11-28 16:59:53,575 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 20 states. [2019-11-28 16:59:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:54,638 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2019-11-28 16:59:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 16:59:54,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-11-28 16:59:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:54,639 INFO L225 Difference]: With dead ends: 131 [2019-11-28 16:59:54,639 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 16:59:54,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 16:59:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 16:59:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2019-11-28 16:59:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 16:59:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-11-28 16:59:54,647 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 35 [2019-11-28 16:59:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:54,647 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-11-28 16:59:54,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 16:59:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-11-28 16:59:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 16:59:54,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:54,651 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1] [2019-11-28 16:59:54,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:54,863 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -233446117, now seen corresponding path program 3 times [2019-11-28 16:59:54,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:54,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124439834] [2019-11-28 16:59:54,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:55,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124439834] [2019-11-28 16:59:55,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36121509] [2019-11-28 16:59:55,147 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:55,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 16:59:55,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:59:55,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-28 16:59:55,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:55,238 INFO L377 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-11-28 16:59:55,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,243 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:59:55,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,280 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:59:55,280 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,308 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-28 16:59:55,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-28 16:59:55,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:55,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:55,376 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,389 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-28 16:59:55,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 30 [2019-11-28 16:59:55,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,479 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_53|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_53|]} [2019-11-28 16:59:55,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 16:59:55,484 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:55,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2019-11-28 16:59:55,525 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:55,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 [2019-11-28 16:59:55,552 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,568 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:43 [2019-11-28 16:59:55,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 116 [2019-11-28 16:59:55,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:59:55,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,672 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 125 [2019-11-28 16:59:55,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:55,674 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,729 INFO L614 ElimStorePlain]: treesize reduction 24, result has 85.8 percent of original size [2019-11-28 16:59:55,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:55,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 55 treesize of output 19 [2019-11-28 16:59:55,749 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,780 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:117 [2019-11-28 16:59:55,826 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_55|], 6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_55|]} [2019-11-28 16:59:55,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 69 treesize of output 54 [2019-11-28 16:59:55,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,881 INFO L614 ElimStorePlain]: treesize reduction 22, result has 92.4 percent of original size [2019-11-28 16:59:55,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 258 [2019-11-28 16:59:55,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:55,966 INFO L377 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2019-11-28 16:59:55,967 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,993 INFO L614 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-28 16:59:55,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:55,993 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:306, output treesize:60 [2019-11-28 16:59:56,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:56,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-11-28 16:59:56,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:56,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:56,083 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:56,118 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-28 16:59:56,123 INFO L377 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 10 [2019-11-28 16:59:56,124 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:56,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:56,135 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:56,135 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-28 16:59:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:56,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:56,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-11-28 16:59:56,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271071819] [2019-11-28 16:59:56,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 16:59:56,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:56,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 16:59:56,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-28 16:59:56,223 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 21 states. [2019-11-28 16:59:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:57,346 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2019-11-28 16:59:57,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 16:59:57,348 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-11-28 16:59:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:57,349 INFO L225 Difference]: With dead ends: 118 [2019-11-28 16:59:57,349 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 16:59:57,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 16:59:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 16:59:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2019-11-28 16:59:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 16:59:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-28 16:59:57,356 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 37 [2019-11-28 16:59:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:57,357 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-28 16:59:57,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 16:59:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-28 16:59:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 16:59:57,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:57,358 INFO L410 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] [2019-11-28 16:59:57,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:57,562 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1007382053, now seen corresponding path program 1 times [2019-11-28 16:59:57,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:57,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183527522] [2019-11-28 16:59:57,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:59:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:59:57,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:59:57,636 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:59:57,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:59:57 BoogieIcfgContainer [2019-11-28 16:59:57,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:59:57,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:59:57,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:59:57,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:59:57,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:59:43" (3/4) ... [2019-11-28 16:59:57,706 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:59:57,781 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:59:57,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:59:57,783 INFO L168 Benchmark]: Toolchain (without parser) took 15911.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 961.7 MB in the beginning and 864.6 MB in the end (delta: 97.1 MB). Peak memory consumption was 403.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:57,783 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:57,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:57,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:57,784 INFO L168 Benchmark]: Boogie Preprocessor took 44.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:57,784 INFO L168 Benchmark]: RCFGBuilder took 641.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:57,785 INFO L168 Benchmark]: TraceAbstraction took 14400.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 195.6 MB). Free memory was 1.0 GB in the beginning and 864.6 MB in the end (delta: 176.3 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:57,785 INFO L168 Benchmark]: Witness Printer took 78.72 ms. Allocated memory is still 1.3 GB. Free memory is still 864.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:57,787 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 677.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 641.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14400.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 195.6 MB). Free memory was 1.0 GB in the beginning and 864.6 MB in the end (delta: 176.3 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. * Witness Printer took 78.72 ms. Allocated memory is still 1.3 GB. Free memory is still 864.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) [L565] COND FALSE !(\read(*root)) [L584] List a = (List) malloc(sizeof(struct node)); [L585] COND FALSE !(a == 0) [L586] List t; [L587] List p = a; [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) [L591] COND FALSE !(t == 0) [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) [L598] COND FALSE !(t == 0) [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a [L604] EXPR p->h [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 760 SDtfs, 1050 SDslu, 3392 SDs, 0 SdLazy, 2445 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 251 SyntacticMatches, 8 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 671 ConstructedInterpolants, 17 QuantifiedInterpolants, 185717 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1198 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 32/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...