./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.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 1f270b702de634d3ad2ee5a400388c6410a4cf10 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0ed9222-m [2019-01-12 09:35:24,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:35:24,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:35:25,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:35:25,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:35:25,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:35:25,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:35:25,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:35:25,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:35:25,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:35:25,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:35:25,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:35:25,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:35:25,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:35:25,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:35:25,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:35:25,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:35:25,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:35:25,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:35:25,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:35:25,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:35:25,056 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:35:25,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:35:25,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:35:25,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:35:25,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:35:25,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:35:25,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:35:25,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:35:25,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:35:25,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:35:25,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:35:25,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:35:25,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:35:25,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:35:25,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:35:25,073 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:35:25,092 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:35:25,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:35:25,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:35:25,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:35:25,094 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:35:25,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:35:25,094 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:35:25,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:35:25,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:35:25,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:35:25,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:35:25,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:35:25,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:35:25,095 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:35:25,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:35:25,096 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:35:25,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:35:25,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:35:25,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:35:25,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:35:25,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:35:25,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:35:25,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:35:25,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:35:25,097 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:35:25,098 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:35:25,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:35:25,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:35:25,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-01-12 09:35:25,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:35:25,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:35:25,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:35:25,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:35:25,151 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:35:25,152 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-12 09:35:25,209 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbda394a/a0ab110b63434d69a75d1211d3f49d3a/FLAGaae72df30 [2019-01-12 09:35:25,804 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:35:25,805 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-12 09:35:25,819 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbda394a/a0ab110b63434d69a75d1211d3f49d3a/FLAGaae72df30 [2019-01-12 09:35:26,036 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbda394a/a0ab110b63434d69a75d1211d3f49d3a [2019-01-12 09:35:26,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:35:26,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:35:26,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:35:26,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:35:26,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:35:26,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26, skipping insertion in model container [2019-01-12 09:35:26,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:35:26,115 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:35:26,476 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:35:26,495 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:35:26,636 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:35:26,690 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:35:26,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26 WrapperNode [2019-01-12 09:35:26,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:35:26,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:35:26,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:35:26,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:35:26,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:35:26,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:35:26,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:35:26,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:35:26,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... [2019-01-12 09:35:26,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:35:26,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:35:26,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:35:26,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:35:26,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:35:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:35:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:35:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:35:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:35:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:35:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:35:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:35:26,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:35:27,414 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:35:27,415 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-12 09:35:27,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:27 BoogieIcfgContainer [2019-01-12 09:35:27,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:35:27,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:35:27,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:35:27,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:35:27,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:35:26" (1/3) ... [2019-01-12 09:35:27,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce3413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:35:27, skipping insertion in model container [2019-01-12 09:35:27,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:26" (2/3) ... [2019-01-12 09:35:27,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce3413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:35:27, skipping insertion in model container [2019-01-12 09:35:27,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:27" (3/3) ... [2019-01-12 09:35:27,426 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-12 09:35:27,434 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:35:27,441 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 09:35:27,458 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 09:35:27,488 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:35:27,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:35:27,489 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:35:27,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:35:27,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:35:27,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:35:27,490 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:35:27,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:35:27,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:35:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-01-12 09:35:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 09:35:27,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:27,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 09:35:27,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-01-12 09:35:27,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:27,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:27,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:27,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:35:27,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:35:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:35:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:35:27,669 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-01-12 09:35:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:27,685 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-01-12 09:35:27,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:35:27,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-01-12 09:35:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:27,695 INFO L225 Difference]: With dead ends: 53 [2019-01-12 09:35:27,695 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:35:27,698 INFO L631 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-01-12 09:35:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:35:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 09:35:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:35:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-12 09:35:27,729 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2019-01-12 09:35:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:27,730 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-12 09:35:27,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:35:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-12 09:35:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 09:35:27,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:27,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:27,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-01-12 09:35:27,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:27,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:27,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:27,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:35:27,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:35:27,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:35:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:27,859 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2019-01-12 09:35:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:28,079 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-12 09:35:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:35:28,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 09:35:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:28,081 INFO L225 Difference]: With dead ends: 31 [2019-01-12 09:35:28,081 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:35:28,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:35:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:35:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-01-12 09:35:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:35:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-12 09:35:28,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2019-01-12 09:35:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:28,088 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-12 09:35:28,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:35:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-01-12 09:35:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:35:28,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:28,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:28,090 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-01-12 09:35:28,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:28,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:28,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:28,288 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-12 09:35:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:28,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:28,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:35:28,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:35:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:35:28,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:35:28,391 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-01-12 09:35:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:28,627 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-01-12 09:35:28,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:35:28,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 09:35:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:28,629 INFO L225 Difference]: With dead ends: 47 [2019-01-12 09:35:28,629 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 09:35:28,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:35:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 09:35:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2019-01-12 09:35:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:35:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-12 09:35:28,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-01-12 09:35:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:28,639 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-12 09:35:28,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:35:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-12 09:35:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:35:28,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:28,640 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:28,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-01-12 09:35:28,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:28,978 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-01-12 09:35:29,161 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-01-12 09:35:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:29,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:29,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:29,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:29,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-12 09:35:29,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:35:29,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:35:29,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,624 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-01-12 09:35:29,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:29,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:29,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-12 09:35:29,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-01-12 09:35:29,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:29,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:35:29,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-12 09:35:29,869 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,936 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:29,956 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:29,993 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:29,999 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:30,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2019-01-12 09:35:30,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:30,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:30,053 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-01-12 09:35:30,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:35:30,098 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2019-01-12 09:35:30,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2019-01-12 09:35:30,180 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:30,210 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:30,250 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:30,277 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:30,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,339 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:114, output treesize:27 [2019-01-12 09:35:30,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:30,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:30,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:35:30,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,560 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 107 [2019-01-12 09:35:30,707 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2019-01-12 09:35:30,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:30,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2019-01-12 09:35:30,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2019-01-12 09:35:30,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-12 09:35:30,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-12 09:35:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:30,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-12 09:35:30,841 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2019-01-12 09:35:30,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-12 09:35:30,921 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,940 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:30,966 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:30,969 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:31,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2019-01-12 09:35:31,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-12 09:35:31,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:31,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:31,028 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,035 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,053 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:31,075 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:249, output treesize:43 [2019-01-12 09:35:31,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2019-01-12 09:35:31,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-12 09:35:31,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-12 09:35:31,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-12 09:35:31,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-01-12 09:35:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:31,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-12 09:35:31,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:35:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:35:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:35:31,370 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2019-01-12 09:35:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:32,041 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-01-12 09:35:32,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:35:32,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-01-12 09:35:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:32,046 INFO L225 Difference]: With dead ends: 60 [2019-01-12 09:35:32,046 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 09:35:32,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:35:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 09:35:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2019-01-12 09:35:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 09:35:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-12 09:35:32,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2019-01-12 09:35:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:32,054 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-12 09:35:32,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:35:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-01-12 09:35:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:35:32,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:32,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:32,055 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:32,057 INFO L82 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2019-01-12 09:35:32,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:32,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:32,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:32,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:32,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:32,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:32,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:35:32,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:35:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:35:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:35:32,203 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-01-12 09:35:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:32,312 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-12 09:35:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:35:32,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-12 09:35:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:32,314 INFO L225 Difference]: With dead ends: 35 [2019-01-12 09:35:32,314 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:35:32,315 INFO L631 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-01-12 09:35:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:35:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-01-12 09:35:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:35:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-12 09:35:32,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2019-01-12 09:35:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:32,319 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-12 09:35:32,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:35:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-01-12 09:35:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:35:32,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:32,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:32,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2019-01-12 09:35:32,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:32,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:35:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:35:32,360 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:35:32,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:35:32 BoogieIcfgContainer [2019-01-12 09:35:32,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:35:32,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:35:32,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:35:32,391 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:35:32,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:27" (3/4) ... [2019-01-12 09:35:32,394 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:35:32,441 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:35:32,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:35:32,442 INFO L168 Benchmark]: Toolchain (without parser) took 6402.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -221.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:32,443 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:32,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:32,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:32,446 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:32,446 INFO L168 Benchmark]: RCFGBuilder took 634.19 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:32,447 INFO L168 Benchmark]: TraceAbstraction took 4971.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:32,447 INFO L168 Benchmark]: Witness Printer took 51.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:32,452 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.39 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. * Boogie Preprocessor took 39.48 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 634.19 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4971.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 51.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list [L1029] COND FALSE !(!(((void*)0) != end)) [L1030] EXPR end->colour [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 3 error locations. UNSAFE Result, 4.9s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 146 SDslu, 204 SDs, 0 SdLazy, 207 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 6 QuantifiedInterpolants, 7500 SizeOfPredicates, 13 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...