./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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-2e94e6a [2018-12-31 04:25:05,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:25:05,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:25:05,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:25:05,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:25:05,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:25:05,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:25:05,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:25:05,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:25:05,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:25:05,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:25:05,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:25:05,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:25:05,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:25:05,241 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:25:05,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:25:05,243 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:25:05,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:25:05,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:25:05,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:25:05,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:25:05,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:25:05,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:25:05,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:25:05,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:25:05,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:25:05,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:25:05,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:25:05,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:25:05,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:25:05,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:25:05,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:25:05,260 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:25:05,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:25:05,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:25:05,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:25:05,262 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:25:05,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:25:05,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:25:05,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:25:05,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:25:05,289 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:25:05,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:25:05,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:25:05,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:25:05,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:25:05,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:25:05,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:25:05,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:25:05,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:25:05,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:25:05,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:25:05,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:25:05,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:25:05,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:25:05,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:25:05,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:25:05,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:25:05,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:25:05,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:25:05,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:25:05,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:25:05,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:25:05,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:25:05,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:25:05,295 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 [2018-12-31 04:25:05,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:25:05,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:25:05,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:25:05,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:25:05,387 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:25:05,388 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 [2018-12-31 04:25:05,449 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8076decda/a4e40f1c65cd4d9cba6b0c74affd8756/FLAGfa8f3218a [2018-12-31 04:25:06,016 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:25:06,016 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:06,029 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8076decda/a4e40f1c65cd4d9cba6b0c74affd8756/FLAGfa8f3218a [2018-12-31 04:25:06,265 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8076decda/a4e40f1c65cd4d9cba6b0c74affd8756 [2018-12-31 04:25:06,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:25:06,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:25:06,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:06,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:25:06,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:25:06,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:06,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52869081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06, skipping insertion in model container [2018-12-31 04:25:06,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:06,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:25:06,334 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:25:06,749 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:06,766 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:25:06,911 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:06,978 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:25:06,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06 WrapperNode [2018-12-31 04:25:06,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:06,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:06,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:25:06,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:25:06,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:07,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:25:07,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:25:07,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:25:07,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (1/1) ... [2018-12-31 04:25:07,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:25:07,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:25:07,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:25:07,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:25:07,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (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 [2018-12-31 04:25:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:25:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:25:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 04:25:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:25:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:25:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:25:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:25:07,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:25:07,742 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:25:07,742 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-31 04:25:07,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:07 BoogieIcfgContainer [2018-12-31 04:25:07,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:25:07,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:25:07,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:25:07,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:25:07,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:25:06" (1/3) ... [2018-12-31 04:25:07,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eebd133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:07, skipping insertion in model container [2018-12-31 04:25:07,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:06" (2/3) ... [2018-12-31 04:25:07,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eebd133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:07, skipping insertion in model container [2018-12-31 04:25:07,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:07" (3/3) ... [2018-12-31 04:25:07,752 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:07,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:25:07,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 04:25:07,791 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 04:25:07,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:25:07,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:25:07,820 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:25:07,820 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:25:07,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:25:07,821 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:25:07,821 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:25:07,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:25:07,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:25:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-31 04:25:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-31 04:25:07,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:07,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-31 04:25:07,846 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2018-12-31 04:25:07,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:07,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:07,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:07,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:07,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:08,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:25:08,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:25:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:25:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:25:08,033 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-12-31 04:25:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:08,049 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2018-12-31 04:25:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:25:08,050 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2018-12-31 04:25:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:08,060 INFO L225 Difference]: With dead ends: 53 [2018-12-31 04:25:08,061 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 04:25:08,064 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 [2018-12-31 04:25:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 04:25:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 04:25:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:25:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-31 04:25:08,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2018-12-31 04:25:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:08,101 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-31 04:25:08,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:25:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-31 04:25:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-31 04:25:08,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:08,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:08,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:08,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2018-12-31 04:25:08,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:08,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:08,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:08,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:08,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:08,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:08,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:08,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:08,188 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2018-12-31 04:25:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:08,500 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-31 04:25:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:08,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-31 04:25:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:08,502 INFO L225 Difference]: With dead ends: 31 [2018-12-31 04:25:08,502 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 04:25:08,504 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 [2018-12-31 04:25:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 04:25:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-12-31 04:25:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 04:25:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-12-31 04:25:08,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2018-12-31 04:25:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:08,516 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-12-31 04:25:08,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-12-31 04:25:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:25:08,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:08,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:08,519 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2018-12-31 04:25:08,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:08,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:08,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:08,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:08,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:08,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:08,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:08,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:08,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:08,791 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2018-12-31 04:25:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:09,055 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-12-31 04:25:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:25:09,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 04:25:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:09,060 INFO L225 Difference]: With dead ends: 47 [2018-12-31 04:25:09,060 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 04:25:09,061 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 [2018-12-31 04:25:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 04:25:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-12-31 04:25:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 04:25:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-31 04:25:09,069 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2018-12-31 04:25:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:09,070 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-31 04:25:09,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-31 04:25:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 04:25:09,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:09,071 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:09,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2018-12-31 04:25:09,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:09,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:09,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:09,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:09,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:09,499 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-31 04:25:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:09,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:25:09,621 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 [2018-12-31 04:25:09,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:09,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:25:09,769 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 [2018-12-31 04:25:09,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:09,953 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 [2018-12-31 04:25:09,975 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 [2018-12-31 04:25:09,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,101 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-31 04:25:10,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:10,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:10,207 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 [2018-12-31 04:25:10,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,271 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 [2018-12-31 04:25:10,314 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 [2018-12-31 04:25:10,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,329 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 [2018-12-31 04:25:10,336 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 [2018-12-31 04:25:10,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:10,417 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:10,451 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:10,457 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:10,490 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 [2018-12-31 04:25:10,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:10,533 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 [2018-12-31 04:25:10,534 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,564 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 [2018-12-31 04:25:10,571 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 [2018-12-31 04:25:10,571 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:10,622 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 [2018-12-31 04:25:10,648 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 [2018-12-31 04:25:10,649 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-31 04:25:10,681 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:25:10,713 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:25:10,741 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:25:10,793 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. [2018-12-31 04:25:10,794 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:114, output treesize:27 [2018-12-31 04:25:10,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:10,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:10,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:10,908 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 [2018-12-31 04:25:10,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,065 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 [2018-12-31 04:25:11,170 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-12-31 04:25:11,175 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 [2018-12-31 04:25:11,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,196 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 [2018-12-31 04:25:11,201 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 [2018-12-31 04:25:11,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,310 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 [2018-12-31 04:25:11,313 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 [2018-12-31 04:25:11,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:11,324 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 [2018-12-31 04:25:11,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,333 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,345 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,401 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 [2018-12-31 04:25:11,405 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 [2018-12-31 04:25:11,405 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,438 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,464 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:11,468 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:11,501 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 [2018-12-31 04:25:11,507 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 [2018-12-31 04:25:11,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:11,516 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 [2018-12-31 04:25:11,517 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,524 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,541 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,563 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. [2018-12-31 04:25:11,563 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:249, output treesize:43 [2018-12-31 04:25:11,749 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 [2018-12-31 04:25:11,768 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 [2018-12-31 04:25:11,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,787 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 [2018-12-31 04:25:11,788 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,797 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 [2018-12-31 04:25:11,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:11,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-12-31 04:25:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-31 04:25:11,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:25:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:25:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:25:11,841 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2018-12-31 04:25:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:12,533 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-12-31 04:25:12,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:25:12,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-31 04:25:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:12,536 INFO L225 Difference]: With dead ends: 60 [2018-12-31 04:25:12,536 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 04:25:12,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-31 04:25:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 04:25:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2018-12-31 04:25:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 04:25:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-31 04:25:12,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-12-31 04:25:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:12,549 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-31 04:25:12,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:25:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-31 04:25:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:25:12,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:12,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:12,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2018-12-31 04:25:12,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:12,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:12,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:12,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:12,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:12,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:12,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:12,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:12,673 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2018-12-31 04:25:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:12,850 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-31 04:25:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:25:12,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-31 04:25:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:12,854 INFO L225 Difference]: With dead ends: 35 [2018-12-31 04:25:12,855 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 04:25:12,855 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 [2018-12-31 04:25:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 04:25:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-12-31 04:25:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 04:25:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-12-31 04:25:12,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2018-12-31 04:25:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:12,860 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-12-31 04:25:12,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-12-31 04:25:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:25:12,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:12,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:12,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2018-12-31 04:25:12,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:12,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:12,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:12,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:12,904 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:25:12,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:25:12 BoogieIcfgContainer [2018-12-31 04:25:12,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:25:12,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:25:12,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:25:12,934 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:25:12,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:07" (3/4) ... [2018-12-31 04:25:12,937 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 04:25:12,986 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:25:12,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:25:12,988 INFO L168 Benchmark]: Toolchain (without parser) took 6718.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -230.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:25:12,989 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. [2018-12-31 04:25:12,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:12,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.98 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. [2018-12-31 04:25:12,990 INFO L168 Benchmark]: Boogie Preprocessor took 39.76 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:12,991 INFO L168 Benchmark]: RCFGBuilder took 658.28 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.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:12,991 INFO L168 Benchmark]: TraceAbstraction took 5188.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:25:12,992 INFO L168 Benchmark]: Witness Printer took 53.14 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. [2018-12-31 04:25:12,995 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 707.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.98 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.76 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.28 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.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5188.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 53.14 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, 5.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.5s 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.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s 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...