./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.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/forester-heap/sll-rb-cnstr_1-2.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 3aee1e8d9b723b18f218b6c1185554e637930c5d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55:00,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:55:00,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:55:00,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:55:00,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:55:00,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:55:00,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:55:00,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:55:00,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:55:00,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:55:00,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:55:00,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:55:00,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:55:00,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:55:00,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:55:00,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:55:00,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:55:00,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:55:00,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:55:00,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:55:00,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:55:00,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:55:00,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:55:00,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:55:00,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:55:00,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:55:00,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:55:00,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:55:00,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:55:00,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:55:00,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:55:00,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:55:00,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:55:00,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:55:00,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:55:00,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:55:00,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:55:00,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:55:00,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:55:00,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:55:00,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:55:00,243 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:55:00,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:55:00,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:55:00,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:55:00,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:55:00,287 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:55:00,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:55:00,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:55:00,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:55:00,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:55:00,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:55:00,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:55:00,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:55:00,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:55:00,291 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:55:00,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:55:00,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:55:00,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:55:00,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:55:00,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:55:00,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:55:00,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:55:00,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:55:00,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:55:00,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:55:00,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:55:00,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:55:00,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:55:00,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:55:00,297 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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2019-11-27 23:55:00,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:55:00,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:55:00,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:55:00,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:55:00,661 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:55:00,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2019-11-27 23:55:00,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad229a7de/c7358cc3a3804fc8aeab2ec2c703cb43/FLAG2d7ed0051 [2019-11-27 23:55:01,306 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:55:01,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2019-11-27 23:55:01,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad229a7de/c7358cc3a3804fc8aeab2ec2c703cb43/FLAG2d7ed0051 [2019-11-27 23:55:01,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad229a7de/c7358cc3a3804fc8aeab2ec2c703cb43 [2019-11-27 23:55:01,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:55:01,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:55:01,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:55:01,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:55:01,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:55:01,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14462867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:01, skipping insertion in model container [2019-11-27 23:55:01,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:55:01" (1/1) ... [2019-11-27 23:55:01,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:55:01,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:55:02,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:55:02,067 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:55:02,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:55:02,201 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:55:02,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02 WrapperNode [2019-11-27 23:55:02,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:55:02,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:55:02,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:55:02,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:55:02,212 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:55:02" (1/1) ... [2019-11-27 23:55:02,229 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:55:02" (1/1) ... [2019-11-27 23:55:02,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:55:02,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:55:02,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:55:02,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:55:02,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (1/1) ... [2019-11-27 23:55:02,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:55:02,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:55:02,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:55:02,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:55:02,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (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:55:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:55:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:55:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:55:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:55:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:55:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:55:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:55:02,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:55:02,744 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:55:02,744 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-27 23:55:02,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:02 BoogieIcfgContainer [2019-11-27 23:55:02,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:55:02,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:55:02,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:55:02,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:55:02,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:55:01" (1/3) ... [2019-11-27 23:55:02,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fd01a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:55:02, skipping insertion in model container [2019-11-27 23:55:02,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:02" (2/3) ... [2019-11-27 23:55:02,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fd01a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:55:02, skipping insertion in model container [2019-11-27 23:55:02,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:02" (3/3) ... [2019-11-27 23:55:02,754 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2019-11-27 23:55:02,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:55:02,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-27 23:55:02,783 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-27 23:55:02,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:55:02,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:55:02,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:55:02,808 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:55:02,809 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:55:02,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:55:02,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:55:02,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:55:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-27 23:55:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 23:55:02,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:02,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 23:55:02,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:02,837 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-11-27 23:55:02,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:02,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084170512] [2019-11-27 23:55:02,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:02,994 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:55:02,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084170512] [2019-11-27 23:55:02,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:02,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:55:02,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611542167] [2019-11-27 23:55:03,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:55:03,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:03,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:55:03,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:55:03,014 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-27 23:55:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:03,032 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-11-27 23:55:03,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:55:03,033 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-27 23:55:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:03,040 INFO L225 Difference]: With dead ends: 53 [2019-11-27 23:55:03,041 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 23:55:03,043 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:55:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 23:55:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-27 23:55:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-27 23:55:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-27 23:55:03,076 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2019-11-27 23:55:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:03,077 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-27 23:55:03,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:55:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-27 23:55:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-27 23:55:03,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:03,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:03,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-11-27 23:55:03,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:03,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435713310] [2019-11-27 23:55:03,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:03,161 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:55:03,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435713310] [2019-11-27 23:55:03,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:03,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:55:03,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995853845] [2019-11-27 23:55:03,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:55:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:55:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:55:03,166 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2019-11-27 23:55:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:03,264 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-11-27 23:55:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:55:03,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-27 23:55:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:03,265 INFO L225 Difference]: With dead ends: 31 [2019-11-27 23:55:03,265 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 23:55:03,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 23:55:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-11-27 23:55:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 23:55:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-27 23:55:03,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2019-11-27 23:55:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:03,277 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-27 23:55:03,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:55:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-27 23:55:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:55:03,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:03,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:03,279 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-11-27 23:55:03,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:03,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769571608] [2019-11-27 23:55:03,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:03,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769571608] [2019-11-27 23:55:03,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:03,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:55:03,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937768574] [2019-11-27 23:55:03,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:55:03,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:55:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:03,465 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-27 23:55:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:03,597 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-27 23:55:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:55:03,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-27 23:55:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:03,599 INFO L225 Difference]: With dead ends: 47 [2019-11-27 23:55:03,599 INFO L226 Difference]: Without dead ends: 45 [2019-11-27 23:55:03,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:55:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-27 23:55:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2019-11-27 23:55:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:55:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-27 23:55:03,617 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-11-27 23:55:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:03,617 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-27 23:55:03,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:55:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-27 23:55:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:55:03,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:03,620 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:03,620 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-11-27 23:55:03,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:03,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161850762] [2019-11-27 23:55:03,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:03,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161850762] [2019-11-27 23:55:03,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736451726] [2019-11-27 23:55:03,899 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:55:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:03,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-27 23:55:03,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:04,050 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:55:04,051 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,071 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,077 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 13 treesize of output 9 [2019-11-27 23:55:04,078 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,091 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,092 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-27 23:55:04,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,154 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-27 23:55:04,155 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,206 INFO L588 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-27 23:55:04,214 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:04,232 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:04,241 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 41 treesize of output 20 [2019-11-27 23:55:04,243 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,255 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,256 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,256 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-11-27 23:55:04,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,315 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-27 23:55:04,316 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,353 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,356 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_int_23|, |v_#memory_int_24|], 4=[|v_#memory_int_26|]} [2019-11-27 23:55:04,360 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:04,393 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,397 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:04,423 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:04,458 INFO L343 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2019-11-27 23:55:04,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2019-11-27 23:55:04,460 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,483 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,486 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:04,489 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:80, output treesize:43 [2019-11-27 23:55:04,625 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 33 treesize of output 13 [2019-11-27 23:55:04,627 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,635 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:04,636 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:04,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-27 23:55:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:04,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:04,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-27 23:55:04,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396538239] [2019-11-27 23:55:04,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:55:04,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:55:04,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:55:04,650 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-11-27 23:55:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:05,154 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-27 23:55:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:55:05,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-11-27 23:55:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:05,155 INFO L225 Difference]: With dead ends: 60 [2019-11-27 23:55:05,156 INFO L226 Difference]: Without dead ends: 58 [2019-11-27 23:55:05,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:55:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-27 23:55:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2019-11-27 23:55:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-27 23:55:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-27 23:55:05,162 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2019-11-27 23:55:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:05,163 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-27 23:55:05,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:55:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-27 23:55:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:55:05,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:05,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:05,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:05,368 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2019-11-27 23:55:05,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:05,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331450489] [2019-11-27 23:55:05,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:05,501 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:55:05,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331450489] [2019-11-27 23:55:05,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:05,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:55:05,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463632383] [2019-11-27 23:55:05,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:55:05,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:05,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:55:05,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:05,504 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-27 23:55:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:05,568 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-27 23:55:05,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:55:05,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 23:55:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:05,569 INFO L225 Difference]: With dead ends: 35 [2019-11-27 23:55:05,569 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:55:05,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:55:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:55:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-27 23:55:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 23:55:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-27 23:55:05,574 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2019-11-27 23:55:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:05,575 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-27 23:55:05,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:55:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-27 23:55:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:55:05,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:05,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:05,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2019-11-27 23:55:05,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:05,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363623513] [2019-11-27 23:55:05,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:55:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:55:05,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:55:05,637 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:55:05,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:55:05 BoogieIcfgContainer [2019-11-27 23:55:05,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:55:05,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:55:05,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:55:05,664 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:55:05,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:02" (3/4) ... [2019-11-27 23:55:05,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:55:05,716 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:55:05,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:55:05,719 INFO L168 Benchmark]: Toolchain (without parser) took 4143.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 961.7 MB in the beginning and 854.7 MB in the end (delta: 107.0 MB). Peak memory consumption was 233.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:05,719 INFO L168 Benchmark]: CDTParser took 0.38 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:55:05,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:05,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:05,721 INFO L168 Benchmark]: Boogie Preprocessor took 32.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:55:05,722 INFO L168 Benchmark]: RCFGBuilder took 459.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:05,726 INFO L168 Benchmark]: TraceAbstraction took 2916.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.3 MB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:05,727 INFO L168 Benchmark]: Witness Printer took 53.03 ms. Allocated memory is still 1.2 GB. Free memory was 861.3 MB in the beginning and 854.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:05,733 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.38 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 626.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 459.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2916.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.3 MB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. * Witness Printer took 53.03 ms. Allocated memory is still 1.2 GB. Free memory was 861.3 MB in the beginning and 854.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list [L1027] COND FALSE !(!(((void*)0) != end)) [L1028] EXPR end->colour [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 152 SDslu, 203 SDs, 0 SdLazy, 205 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, 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, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 6 QuantifiedInterpolants, 7236 SizeOfPredicates, 11 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 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...