./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.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/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573d04c3ab16ffed1ccac6c6179d92b670a825d7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:25:10,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:25:10,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:25:10,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:25:10,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:25:10,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:25:10,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:25:10,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:25:10,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:25:10,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:25:10,228 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:25:10,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:25:10,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:25:10,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:25:10,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:25:10,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:25:10,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:25:10,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:25:10,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:25:10,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:25:10,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:25:10,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:25:10,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:25:10,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:25:10,267 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:25:10,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:25:10,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:25:10,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:25:10,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:25:10,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:25:10,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:25:10,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:25:10,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:25:10,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:25:10,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:25:10,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:25:10,279 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:25:10,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:25:10,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:25:10,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:25:10,306 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:25:10,306 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:25:10,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:25:10,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:25:10,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:25:10,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:25:10,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:25:10,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:25:10,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:25:10,309 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:25:10,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:25:10,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:25:10,310 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:25:10,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:25:10,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:25:10,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:25:10,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:25:10,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:25:10,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:25:10,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:25:10,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:25:10,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:25:10,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:25:10,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:25:10,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:25:10,312 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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2018-12-31 05:25:10,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:25:10,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:25:10,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:25:10,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:25:10,405 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:25:10,406 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:10,467 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc08d020/9df69c80ea8143baacc83b19eb4cb2e1/FLAG3d40a78a7 [2018-12-31 05:25:10,967 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:25:10,968 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:10,993 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc08d020/9df69c80ea8143baacc83b19eb4cb2e1/FLAG3d40a78a7 [2018-12-31 05:25:11,288 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc08d020/9df69c80ea8143baacc83b19eb4cb2e1 [2018-12-31 05:25:11,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:25:11,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:25:11,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:25:11,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:25:11,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:25:11,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:25:11" (1/1) ... [2018-12-31 05:25:11,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3147488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:11, skipping insertion in model container [2018-12-31 05:25:11,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:25:11" (1/1) ... [2018-12-31 05:25:11,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:25:11,372 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:25:11,764 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:25:11,783 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:25:11,931 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:25:12,002 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:25:12,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12 WrapperNode [2018-12-31 05:25:12,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:25:12,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:25:12,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:25:12,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:25:12,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:25:12,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:25:12,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:25:12,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:25:12,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (1/1) ... [2018-12-31 05:25:12,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:25:12,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:25:12,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:25:12,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:25:12,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (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 05:25:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:25:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:25:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 05:25:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 05:25:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 05:25:12,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:25:12,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:25:12,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:25:12,704 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:25:12,705 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-31 05:25:12,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:12 BoogieIcfgContainer [2018-12-31 05:25:12,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:25:12,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:25:12,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:25:12,710 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:25:12,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:25:11" (1/3) ... [2018-12-31 05:25:12,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfab291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:25:12, skipping insertion in model container [2018-12-31 05:25:12,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:12" (2/3) ... [2018-12-31 05:25:12,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfab291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:25:12, skipping insertion in model container [2018-12-31 05:25:12,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:12" (3/3) ... [2018-12-31 05:25:12,714 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:12,724 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:25:12,732 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:25:12,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:25:12,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:25:12,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:25:12,779 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:25:12,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:25:12,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:25:12,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:25:12,779 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:25:12,780 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:25:12,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:25:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-31 05:25:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 05:25:12,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:12,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:12,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1301883023, now seen corresponding path program 1 times [2018-12-31 05:25:12,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:12,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:12,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:12,941 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 05:25:12,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:12,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:25:12,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:25:12,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:25:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:25:12,971 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-12-31 05:25:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:12,988 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2018-12-31 05:25:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:25:12,990 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 05:25:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:13,003 INFO L225 Difference]: With dead ends: 48 [2018-12-31 05:25:13,003 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 05:25:13,006 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 05:25:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 05:25:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-31 05:25:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 05:25:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-31 05:25:13,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2018-12-31 05:25:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:13,044 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-31 05:25:13,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:25:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-12-31 05:25:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 05:25:13,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:13,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:13,046 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1861661424, now seen corresponding path program 1 times [2018-12-31 05:25:13,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:13,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:13,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:13,110 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 05:25:13,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:13,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:25:13,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:25:13,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:25:13,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:25:13,113 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2018-12-31 05:25:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:13,169 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2018-12-31 05:25:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:25:13,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-31 05:25:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:13,171 INFO L225 Difference]: With dead ends: 46 [2018-12-31 05:25:13,171 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 05:25:13,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:25:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 05:25:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-12-31 05:25:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 05:25:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-12-31 05:25:13,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2018-12-31 05:25:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:13,178 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-31 05:25:13,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:25:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-12-31 05:25:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 05:25:13,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:13,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:13,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1904747229, now seen corresponding path program 1 times [2018-12-31 05:25:13,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:13,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:13,345 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 05:25:13,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:13,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:13,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:13,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 05:25:13,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:25:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:25:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:25:13,527 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 5 states. [2018-12-31 05:25:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:13,642 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-12-31 05:25:13,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:25:13,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-31 05:25:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:13,644 INFO L225 Difference]: With dead ends: 53 [2018-12-31 05:25:13,644 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 05:25:13,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:25:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 05:25:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-12-31 05:25:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 05:25:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2018-12-31 05:25:13,651 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 19 [2018-12-31 05:25:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:13,651 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2018-12-31 05:25:13,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:25:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-12-31 05:25:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 05:25:13,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:13,653 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:13,653 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash 821075056, now seen corresponding path program 2 times [2018-12-31 05:25:13,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:13,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:13,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:13,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:13,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:13,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:13,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:25:13,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:25:13,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:13,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:14,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:14,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-31 05:25:14,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:25:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:25:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:25:14,178 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 8 states. [2018-12-31 05:25:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:14,537 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-12-31 05:25:14,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:25:14,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-31 05:25:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:14,539 INFO L225 Difference]: With dead ends: 67 [2018-12-31 05:25:14,540 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 05:25:14,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:25:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 05:25:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-12-31 05:25:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 05:25:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-31 05:25:14,548 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 26 [2018-12-31 05:25:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:14,548 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-31 05:25:14,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:25:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-31 05:25:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 05:25:14,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:14,550 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:14,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 911391037, now seen corresponding path program 1 times [2018-12-31 05:25:14,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:14,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:14,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:14,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:14,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:14,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:14,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:15,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:15,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-31 05:25:15,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 05:25:15,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 05:25:15,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:25:15,054 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 7 states. [2018-12-31 05:25:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:15,288 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-12-31 05:25:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:25:15,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-12-31 05:25:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:15,291 INFO L225 Difference]: With dead ends: 67 [2018-12-31 05:25:15,291 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 05:25:15,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:25:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 05:25:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-12-31 05:25:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 05:25:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-12-31 05:25:15,304 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 33 [2018-12-31 05:25:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:15,304 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-31 05:25:15,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 05:25:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2018-12-31 05:25:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 05:25:15,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:15,309 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:15,310 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 708759378, now seen corresponding path program 2 times [2018-12-31 05:25:15,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:15,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:15,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:15,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:25:15,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:25:15,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:15,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 05:25:15,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:25:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:25:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:25:15,857 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2018-12-31 05:25:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:16,060 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-12-31 05:25:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:25:16,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-31 05:25:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:16,065 INFO L225 Difference]: With dead ends: 68 [2018-12-31 05:25:16,065 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 05:25:16,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:25:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 05:25:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-31 05:25:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 05:25:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2018-12-31 05:25:16,079 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 40 [2018-12-31 05:25:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:16,082 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2018-12-31 05:25:16,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:25:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-12-31 05:25:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 05:25:16,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:16,089 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:16,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash 338077597, now seen corresponding path program 3 times [2018-12-31 05:25:16,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:16,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:16,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:16,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:16,609 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 8 [2018-12-31 05:25:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 05:25:16,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:16,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:16,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:25:17,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:25:17,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:17,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:17,367 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 16 treesize of output 13 [2018-12-31 05:25:17,374 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 05:25:17,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,383 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 05:25:17,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2018-12-31 05:25:17,456 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 41 treesize of output 34 [2018-12-31 05:25:17,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 56 [2018-12-31 05:25:17,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2018-12-31 05:25:17,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,676 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 45 treesize of output 36 [2018-12-31 05:25:17,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:17,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2018-12-31 05:25:17,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,730 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,751 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:66, output treesize:23 [2018-12-31 05:25:17,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-12-31 05:25:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-12-31 05:25:17,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:17,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2018-12-31 05:25:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 05:25:18,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:18,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-31 05:25:18,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 05:25:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 05:25:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-31 05:25:18,036 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 19 states. [2018-12-31 05:25:18,795 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-31 05:25:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:19,014 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2018-12-31 05:25:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 05:25:19,016 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-31 05:25:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:19,017 INFO L225 Difference]: With dead ends: 79 [2018-12-31 05:25:19,017 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 05:25:19,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2018-12-31 05:25:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 05:25:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-12-31 05:25:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 05:25:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-12-31 05:25:19,026 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 47 [2018-12-31 05:25:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:19,026 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-12-31 05:25:19,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 05:25:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-12-31 05:25:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 05:25:19,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:19,027 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:19,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash 339924639, now seen corresponding path program 1 times [2018-12-31 05:25:19,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:19,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-31 05:25:19,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:19,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:19,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:19,844 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 05:25:19,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:19,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:19,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-31 05:25:19,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:19,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:19,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-31 05:25:19,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:19,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:19,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-31 05:25:19,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 05:25:19,996 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 05:25:20,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,002 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 05:25:20,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,023 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2018-12-31 05:25:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-31 05:25:20,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 56 [2018-12-31 05:25:20,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2018-12-31 05:25:20,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,180 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-31 05:25:20,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:20,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2018-12-31 05:25:20,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,227 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2018-12-31 05:25:20,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-31 05:25:20,248 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 05:25:20,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:20,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2018-12-31 05:25:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 05:25:20,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:20,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-12-31 05:25:20,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 05:25:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 05:25:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-12-31 05:25:20,448 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 20 states. [2018-12-31 05:25:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:21,569 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2018-12-31 05:25:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 05:25:21,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-12-31 05:25:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:21,572 INFO L225 Difference]: With dead ends: 86 [2018-12-31 05:25:21,572 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 05:25:21,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2018-12-31 05:25:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 05:25:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2018-12-31 05:25:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-31 05:25:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2018-12-31 05:25:21,583 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 47 [2018-12-31 05:25:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:21,583 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2018-12-31 05:25:21,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 05:25:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-12-31 05:25:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 05:25:21,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:21,585 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:21,585 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash 339926561, now seen corresponding path program 1 times [2018-12-31 05:25:21,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:21,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:21,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:21,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:25:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:25:22,084 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:25:22,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:25:22 BoogieIcfgContainer [2018-12-31 05:25:22,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:25:22,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:25:22,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:25:22,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:25:22,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:12" (3/4) ... [2018-12-31 05:25:22,171 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:25:22,282 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:25:22,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:25:22,284 INFO L168 Benchmark]: Toolchain (without parser) took 10990.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -273.1 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:22,284 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 05:25:22,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:22,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.68 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 05:25:22,295 INFO L168 Benchmark]: Boogie Preprocessor took 35.38 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:22,295 INFO L168 Benchmark]: RCFGBuilder took 599.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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:22,295 INFO L168 Benchmark]: TraceAbstraction took 9459.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:22,296 INFO L168 Benchmark]: Witness Printer took 116.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:22,300 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.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.68 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 35.38 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 599.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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9459.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Witness Printer took 116.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; [L568] DLL head = ((void *)0); [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND FALSE !(\read(head)) [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND FALSE !(len > 0) [L585] return head; [L589] DLL head = dll_create(len); [L590] head->next [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. UNSAFE Result, 9.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 214 SDtfs, 941 SDslu, 500 SDs, 0 SdLazy, 444 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, 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, 8 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 495 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 434 ConstructedInterpolants, 0 QuantifiedInterpolants, 57825 SizeOfPredicates, 44 NumberOfNonLiveVariables, 975 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 271/460 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...