./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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-ext3-properties/dll_nullified-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 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-27 23:58:09,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:58:09,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:58:09,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:58:09,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:58:09,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:58:09,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:58:09,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:58:09,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:58:09,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:58:09,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:58:09,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:58:09,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:58:09,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:58:09,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:58:09,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:58:09,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:58:09,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:58:09,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:58:09,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:58:09,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:58:09,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:58:09,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:58:09,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:58:09,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:58:09,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:58:09,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:58:09,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:58:09,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:58:09,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:58:09,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:58:09,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:58:09,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:58:09,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:58:09,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:58:09,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:58:09,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:58:09,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:58:09,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:58:09,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:58:09,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:58:09,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:58:09,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:58:09,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:58:09,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:58:09,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:58:09,565 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:58:09,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:58:09,566 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:58:09,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:58:09,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:58:09,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:58:09,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:58:09,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:58:09,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:58:09,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:58:09,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:58:09,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:58:09,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:58:09,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:58:09,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:58:09,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:58:09,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:58:09,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:58:09,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:58:09,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:58:09,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:58:09,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:58:09,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:58:09,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:58:09,572 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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-11-27 23:58:09,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:58:09,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:58:09,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:58:09,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:58:09,937 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:58:09,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-11-27 23:58:10,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525927299/99750d7ce07a4e0895ccfe2d241eaab4/FLAG20b7afaa3 [2019-11-27 23:58:10,616 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:58:10,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-11-27 23:58:10,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525927299/99750d7ce07a4e0895ccfe2d241eaab4/FLAG20b7afaa3 [2019-11-27 23:58:10,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525927299/99750d7ce07a4e0895ccfe2d241eaab4 [2019-11-27 23:58:10,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:58:10,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:58:10,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:10,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:58:10,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:58:10,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:10" (1/1) ... [2019-11-27 23:58:10,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564c4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:10, skipping insertion in model container [2019-11-27 23:58:10,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:10" (1/1) ... [2019-11-27 23:58:10,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:58:10,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:58:11,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:11,372 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:58:11,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:11,476 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:58:11,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11 WrapperNode [2019-11-27 23:58:11,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:11,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:11,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:58:11,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:58:11,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:11,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:58:11,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:58:11,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:58:11,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (1/1) ... [2019-11-27 23:58:11,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:58:11,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:58:11,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:58:11,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:58:11,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (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-27 23:58:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:58:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:58:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:58:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:58:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:58:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:58:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:58:11,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:58:12,001 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:58:12,001 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 23:58:12,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:12 BoogieIcfgContainer [2019-11-27 23:58:12,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:58:12,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:58:12,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:58:12,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:58:12,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:58:10" (1/3) ... [2019-11-27 23:58:12,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:12, skipping insertion in model container [2019-11-27 23:58:12,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:11" (2/3) ... [2019-11-27 23:58:12,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:12, skipping insertion in model container [2019-11-27 23:58:12,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:12" (3/3) ... [2019-11-27 23:58:12,012 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2019-11-27 23:58:12,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:58:12,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:58:12,044 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:58:12,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:58:12,071 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:58:12,071 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:58:12,071 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:58:12,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:58:12,072 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:58:12,072 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:58:12,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:58:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-27 23:58:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 23:58:12,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:12,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:12,098 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2019-11-27 23:58:12,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:12,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771506224] [2019-11-27 23:58:12,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:12,234 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-27 23:58:12,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771506224] [2019-11-27 23:58:12,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:12,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:58:12,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311828329] [2019-11-27 23:58:12,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:58:12,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:58:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:58:12,259 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-27 23:58:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:12,281 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-11-27 23:58:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:58:12,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-27 23:58:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:12,294 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:58:12,295 INFO L226 Difference]: Without dead ends: 24 [2019-11-27 23:58:12,298 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-27 23:58:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-27 23:58:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-27 23:58:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 23:58:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-27 23:58:12,330 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2019-11-27 23:58:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:12,330 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-27 23:58:12,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:58:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-11-27 23:58:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 23:58:12,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:12,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:12,332 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2019-11-27 23:58:12,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:12,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642130988] [2019-11-27 23:58:12,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:12,388 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-27 23:58:12,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642130988] [2019-11-27 23:58:12,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:12,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:58:12,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684878842] [2019-11-27 23:58:12,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:58:12,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:58:12,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:58:12,392 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-11-27 23:58:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:12,422 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-11-27 23:58:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:58:12,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 23:58:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:12,426 INFO L225 Difference]: With dead ends: 46 [2019-11-27 23:58:12,426 INFO L226 Difference]: Without dead ends: 31 [2019-11-27 23:58:12,427 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-27 23:58:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-27 23:58:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-27 23:58:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:58:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-27 23:58:12,433 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2019-11-27 23:58:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:12,433 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-27 23:58:12,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:58:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-11-27 23:58:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:58:12,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:12,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:12,434 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2019-11-27 23:58:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:12,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522180989] [2019-11-27 23:58:12,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:12,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522180989] [2019-11-27 23:58:12,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297710851] [2019-11-27 23:58:12,563 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-27 23:58:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:12,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:58:12,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:12,676 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-27 23:58:12,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:58:12,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 23:58:12,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328623150] [2019-11-27 23:58:12,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:58:12,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:58:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:58:12,679 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2019-11-27 23:58:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:12,703 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2019-11-27 23:58:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:58:12,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 23:58:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:12,705 INFO L225 Difference]: With dead ends: 53 [2019-11-27 23:58:12,705 INFO L226 Difference]: Without dead ends: 31 [2019-11-27 23:58:12,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:58:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-27 23:58:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-27 23:58:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:58:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2019-11-27 23:58:12,712 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 19 [2019-11-27 23:58:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:12,712 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-27 23:58:12,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:58:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2019-11-27 23:58:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:58:12,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:12,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:12,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:12,916 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1772850436, now seen corresponding path program 1 times [2019-11-27 23:58:12,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:12,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516675297] [2019-11-27 23:58:12,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:12,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516675297] [2019-11-27 23:58:12,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992086384] [2019-11-27 23:58:12,982 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-27 23:58:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:13,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:58:13,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:13,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:13,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-27 23:58:13,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415155468] [2019-11-27 23:58:13,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:58:13,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:58:13,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:58:13,104 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 5 states. [2019-11-27 23:58:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:13,152 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2019-11-27 23:58:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:58:13,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-27 23:58:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:13,155 INFO L225 Difference]: With dead ends: 53 [2019-11-27 23:58:13,156 INFO L226 Difference]: Without dead ends: 38 [2019-11-27 23:58:13,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:58:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-27 23:58:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-11-27 23:58:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:58:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-27 23:58:13,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2019-11-27 23:58:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:13,165 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-27 23:58:13,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:58:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-27 23:58:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:58:13,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:13,168 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:13,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:13,371 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash -282378703, now seen corresponding path program 1 times [2019-11-27 23:58:13,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:13,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818945022] [2019-11-27 23:58:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:13,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818945022] [2019-11-27 23:58:13,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185590115] [2019-11-27 23:58:13,552 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-27 23:58:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:13,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:58:13,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:13,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:13,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-27 23:58:13,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590606652] [2019-11-27 23:58:13,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:58:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:58:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:58:13,666 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 6 states. [2019-11-27 23:58:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:13,731 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-11-27 23:58:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:58:13,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-27 23:58:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:13,733 INFO L225 Difference]: With dead ends: 60 [2019-11-27 23:58:13,734 INFO L226 Difference]: Without dead ends: 45 [2019-11-27 23:58:13,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:58:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-27 23:58:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-27 23:58:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 23:58:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-11-27 23:58:13,743 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 26 [2019-11-27 23:58:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:13,746 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-27 23:58:13,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:58:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-11-27 23:58:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 23:58:13,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:13,747 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:13,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:13,949 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:13,950 INFO L82 PathProgramCache]: Analyzing trace with hash 700996956, now seen corresponding path program 2 times [2019-11-27 23:58:13,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:13,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625233202] [2019-11-27 23:58:13,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:14,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625233202] [2019-11-27 23:58:14,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258069812] [2019-11-27 23:58:14,145 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 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-27 23:58:14,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:58:14,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:14,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 23:58:14,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:14,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:14,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-27 23:58:14,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834500914] [2019-11-27 23:58:14,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:58:14,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:58:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:58:14,276 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 7 states. [2019-11-27 23:58:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:14,328 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2019-11-27 23:58:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:58:14,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-27 23:58:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:14,330 INFO L225 Difference]: With dead ends: 67 [2019-11-27 23:58:14,330 INFO L226 Difference]: Without dead ends: 52 [2019-11-27 23:58:14,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:58:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-27 23:58:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-27 23:58:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-27 23:58:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-11-27 23:58:14,337 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 33 [2019-11-27 23:58:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:14,337 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-11-27 23:58:14,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:58:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-11-27 23:58:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 23:58:14,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:14,339 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:14,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:14,542 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:14,543 INFO L82 PathProgramCache]: Analyzing trace with hash -338892847, now seen corresponding path program 3 times [2019-11-27 23:58:14,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:14,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119019762] [2019-11-27 23:58:14,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:14,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119019762] [2019-11-27 23:58:14,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262209823] [2019-11-27 23:58:14,682 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 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-27 23:58:15,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-27 23:58:15,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:15,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-27 23:58:15,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:15,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,494 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 16 treesize of output 17 [2019-11-27 23:58:15,494 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:15,506 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:15,507 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:15,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2019-11-27 23:58:15,539 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_int_17|], 10=[|v_#memory_int_19|]} [2019-11-27 23:58:15,553 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:15,575 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:15,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:15,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-11-27 23:58:15,597 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:15,610 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:15,611 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:15,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:23 [2019-11-27 23:58:15,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:58:15,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:15,627 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 36 treesize of output 23 [2019-11-27 23:58:15,628 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:15,638 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:15,639 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:15,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2019-11-27 23:58:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 23:58:15,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:58:15,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2019-11-27 23:58:15,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955019327] [2019-11-27 23:58:15,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:58:15,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:58:15,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:58:15,769 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 11 states. [2019-11-27 23:58:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:16,331 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2019-11-27 23:58:16,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:58:16,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-11-27 23:58:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:16,332 INFO L225 Difference]: With dead ends: 72 [2019-11-27 23:58:16,332 INFO L226 Difference]: Without dead ends: 59 [2019-11-27 23:58:16,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-11-27 23:58:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-27 23:58:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2019-11-27 23:58:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:58:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2019-11-27 23:58:16,339 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 40 [2019-11-27 23:58:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:16,340 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-11-27 23:58:16,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:58:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2019-11-27 23:58:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 23:58:16,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:16,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:16,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:16,547 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:16,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -337045805, now seen corresponding path program 1 times [2019-11-27 23:58:16,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:16,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65863210] [2019-11-27 23:58:16,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:16,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65863210] [2019-11-27 23:58:16,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521693617] [2019-11-27 23:58:16,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 23:58:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:16,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:58:16,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:16,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:16,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-27 23:58:16,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674894500] [2019-11-27 23:58:16,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:58:16,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:16,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:58:16,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:16,755 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 8 states. [2019-11-27 23:58:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:16,794 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2019-11-27 23:58:16,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:58:16,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-27 23:58:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:16,797 INFO L225 Difference]: With dead ends: 74 [2019-11-27 23:58:16,799 INFO L226 Difference]: Without dead ends: 56 [2019-11-27 23:58:16,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-27 23:58:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-27 23:58:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-27 23:58:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-11-27 23:58:16,812 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 40 [2019-11-27 23:58:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:16,813 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-11-27 23:58:16,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:58:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2019-11-27 23:58:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 23:58:16,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:16,814 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:17,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:17,015 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 2 times [2019-11-27 23:58:17,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:17,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896110458] [2019-11-27 23:58:17,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-27 23:58:17,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896110458] [2019-11-27 23:58:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397842415] [2019-11-27 23:58:17,555 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 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-27 23:58:17,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:58:17,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:17,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-27 23:58:17,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:17,721 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-27 23:58:17,721 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:17,726 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:17,727 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:17,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:58:17,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:17,804 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-27 23:58:17,805 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:17,810 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:17,810 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:17,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-27 23:58:17,845 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-27 23:58:17,845 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 1 case distinctions, treesize of input 16 treesize of output 17 [2019-11-27 23:58:17,845 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:17,852 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:17,852 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:17,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-11-27 23:58:17,881 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_int_21|], 10=[|v_#memory_int_23|]} [2019-11-27 23:58:17,887 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:17,903 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:17,988 INFO L343 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2019-11-27 23:58:17,989 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 41 [2019-11-27 23:58:17,990 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,002 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,003 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2019-11-27 23:58:18,013 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-27 23:58:18,014 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2019-11-27 23:58:18,015 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,022 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:18,023 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:18,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2019-11-27 23:58:18,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-27 23:58:18,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:18,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-27 23:58:18,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635478248] [2019-11-27 23:58:18,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-27 23:58:18,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:18,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-27 23:58:18,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-27 23:58:18,126 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 20 states. [2019-11-27 23:58:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:19,187 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2019-11-27 23:58:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 23:58:19,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-11-27 23:58:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:19,189 INFO L225 Difference]: With dead ends: 86 [2019-11-27 23:58:19,190 INFO L226 Difference]: Without dead ends: 73 [2019-11-27 23:58:19,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:58:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-27 23:58:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2019-11-27 23:58:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-27 23:58:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-11-27 23:58:19,199 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2019-11-27 23:58:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:19,200 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-11-27 23:58:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-27 23:58:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-11-27 23:58:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 23:58:19,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:19,202 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:19,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:19,407 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2019-11-27 23:58:19,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:19,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649482251] [2019-11-27 23:58:19,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:58:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:58:19,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:58:19,712 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:58:19,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:58:19 BoogieIcfgContainer [2019-11-27 23:58:19,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:58:19,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:58:19,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:58:19,781 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:58:19,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:12" (3/4) ... [2019-11-27 23:58:19,784 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:58:19,902 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:58:19,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:58:19,905 INFO L168 Benchmark]: Toolchain (without parser) took 9002.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -313.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:19,907 INFO L168 Benchmark]: CDTParser took 0.32 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-27 23:58:19,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,910 INFO L168 Benchmark]: Boogie Preprocessor took 33.24 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-27 23:58:19,911 INFO L168 Benchmark]: RCFGBuilder took 443.22 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,911 INFO L168 Benchmark]: TraceAbstraction took 7776.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -233.0 MB). Peak memory consumption was 353.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,911 INFO L168 Benchmark]: Witness Printer took 123.29 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:19,913 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.32 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 571.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.24 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 443.22 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7776.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -233.0 MB). Peak memory consumption was 353.4 MB. Max. memory is 11.5 GB. * Witness Printer took 123.29 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; [L568] DLL head = ((void *)0); [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND FALSE !(\read(head)) [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND FALSE !(len > 0) [L585] return head; [L589] DLL head = dll_create(len); [L590] head->next [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.6s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 250 SDtfs, 703 SDslu, 612 SDs, 0 SdLazy, 439 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 519 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 54239 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 184/404 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...