./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_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 2a99c5e1922c5e2d2ce50e982def02dab2dbd81e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 10:35:43,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:35:43,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:35:43,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:35:43,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:35:43,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:35:43,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:35:43,873 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:35:43,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:35:43,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:35:43,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:35:43,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:35:43,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:35:43,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:35:43,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:35:43,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:35:43,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:35:43,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:35:43,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:35:43,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:35:43,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:35:43,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:35:43,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:35:43,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:35:43,918 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:35:43,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:35:43,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:35:43,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:35:43,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:35:43,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:35:43,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:35:43,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:35:43,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:35:43,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:35:43,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:35:43,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:35:43,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:35:43,953 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:35:43,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:35:43,955 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:35:43,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:35:43,955 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:35:43,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:35:43,955 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:35:43,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:35:43,957 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:35:43,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:35:43,958 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:35:43,958 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:35:43,958 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:35:43,958 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:35:43,958 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:35:43,960 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:35:43,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:35:43,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:35:43,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:35:43,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:35:43,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:35:43,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:35:43,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:35:43,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:35:43,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:35:43,962 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:35:43,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:35:43,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:35:43,963 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 -> 2a99c5e1922c5e2d2ce50e982def02dab2dbd81e [2019-01-12 10:35:44,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:35:44,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:35:44,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:35:44,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:35:44,045 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:35:44,047 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2019-01-12 10:35:44,110 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28d2e931/bf8e7b990ccb4800893c53a26b9d44a3/FLAG17f7e5453 [2019-01-12 10:35:44,619 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:35:44,620 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2019-01-12 10:35:44,643 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28d2e931/bf8e7b990ccb4800893c53a26b9d44a3/FLAG17f7e5453 [2019-01-12 10:35:44,880 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28d2e931/bf8e7b990ccb4800893c53a26b9d44a3 [2019-01-12 10:35:44,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:35:44,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:35:44,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:35:44,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:35:44,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:35:44,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:35:44" (1/1) ... [2019-01-12 10:35:44,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74116921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:44, skipping insertion in model container [2019-01-12 10:35:44,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:35:44" (1/1) ... [2019-01-12 10:35:44,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:35:44,962 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:35:45,338 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:35:45,347 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:35:45,459 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:35:45,530 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:35:45,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45 WrapperNode [2019-01-12 10:35:45,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:35:45,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:35:45,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:35:45,532 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:35:45,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:35:45,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:35:45,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:35:45,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:35:45,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... [2019-01-12 10:35:45,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:35:45,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:35:45,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:35:45,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:35:45,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:35:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 10:35:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 10:35:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 10:35:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:35:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:35:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:35:46,121 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:35:46,122 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 10:35:46,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:46 BoogieIcfgContainer [2019-01-12 10:35:46,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:35:46,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:35:46,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:35:46,130 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:35:46,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:35:44" (1/3) ... [2019-01-12 10:35:46,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f40dd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:35:46, skipping insertion in model container [2019-01-12 10:35:46,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:45" (2/3) ... [2019-01-12 10:35:46,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f40dd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:35:46, skipping insertion in model container [2019-01-12 10:35:46,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:46" (3/3) ... [2019-01-12 10:35:46,135 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_false-unreach-call_false-valid-memcleanup.i [2019-01-12 10:35:46,143 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:35:46,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:35:46,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:35:46,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:35:46,199 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:35:46,199 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:35:46,199 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:35:46,199 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:35:46,199 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:35:46,200 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:35:46,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:35:46,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:35:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-12 10:35:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 10:35:46,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:46,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:46,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:46,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1050078975, now seen corresponding path program 1 times [2019-01-12 10:35:46,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:46,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:46,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:35:46,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 10:35:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 10:35:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:35:46,352 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-01-12 10:35:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:46,367 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-01-12 10:35:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 10:35:46,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 10:35:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:46,377 INFO L225 Difference]: With dead ends: 41 [2019-01-12 10:35:46,377 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 10:35:46,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:35:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 10:35:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 10:35:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 10:35:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-12 10:35:46,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2019-01-12 10:35:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:46,408 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-12 10:35:46,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 10:35:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-01-12 10:35:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 10:35:46,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:46,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:46,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash 924106356, now seen corresponding path program 1 times [2019-01-12 10:35:46,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:46,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:46,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:46,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:46,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:35:46,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:35:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:35:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:35:46,520 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-01-12 10:35:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:46,601 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-01-12 10:35:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:35:46,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 10:35:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:46,603 INFO L225 Difference]: With dead ends: 28 [2019-01-12 10:35:46,603 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 10:35:46,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:35:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 10:35:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-12 10:35:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:35:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-12 10:35:46,610 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2019-01-12 10:35:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:46,611 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-12 10:35:46,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:35:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-01-12 10:35:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:35:46,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:46,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:46,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1149244957, now seen corresponding path program 1 times [2019-01-12 10:35:46,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:46,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:46,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:46,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:46,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:46,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 10:35:46,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:35:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:35:46,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:35:46,813 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-01-12 10:35:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:47,106 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-01-12 10:35:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:35:47,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 10:35:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:47,109 INFO L225 Difference]: With dead ends: 26 [2019-01-12 10:35:47,110 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 10:35:47,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:35:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 10:35:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-12 10:35:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 10:35:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-12 10:35:47,116 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2019-01-12 10:35:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:47,116 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-12 10:35:47,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:35:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-01-12 10:35:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:35:47,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:47,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:47,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:47,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1318509563, now seen corresponding path program 1 times [2019-01-12 10:35:47,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:47,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:47,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:47,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:47,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:35:47,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:47,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:35:47,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:47,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:35:47,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:35:47,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 10:35:47,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:35:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:35:47,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:35:47,346 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 6 states. [2019-01-12 10:35:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:47,482 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-12 10:35:47,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:35:47,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 10:35:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:47,484 INFO L225 Difference]: With dead ends: 33 [2019-01-12 10:35:47,484 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 10:35:47,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:35:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 10:35:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-12 10:35:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:35:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-12 10:35:47,492 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-01-12 10:35:47,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:47,493 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-12 10:35:47,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:35:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-01-12 10:35:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 10:35:47,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:47,494 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:47,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2117322972, now seen corresponding path program 2 times [2019-01-12 10:35:47,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:47,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:47,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:47,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:47,714 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 [2019-01-12 10:35:47,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:35:47,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:35:47,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:35:47,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:35:48,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:35:48,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-01-12 10:35:48,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 10:35:48,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 10:35:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:35:48,316 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 13 states. [2019-01-12 10:35:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:48,837 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-12 10:35:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 10:35:48,841 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-01-12 10:35:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:48,842 INFO L225 Difference]: With dead ends: 35 [2019-01-12 10:35:48,842 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 10:35:48,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-01-12 10:35:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 10:35:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 10:35:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 10:35:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-12 10:35:48,849 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2019-01-12 10:35:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:48,849 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-12 10:35:48,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 10:35:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-12 10:35:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 10:35:48,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:48,850 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:48,851 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1344305789, now seen corresponding path program 3 times [2019-01-12 10:35:48,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:48,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:48,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:35:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:49,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:49,185 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 [2019-01-12 10:35:49,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:35:49,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-12 10:35:49,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:35:49,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 10:35:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:35:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-01-12 10:35:49,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 10:35:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 10:35:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-01-12 10:35:49,563 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 19 states. [2019-01-12 10:35:50,488 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-12 10:35:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:51,658 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-01-12 10:35:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 10:35:51,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-01-12 10:35:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:51,660 INFO L225 Difference]: With dead ends: 61 [2019-01-12 10:35:51,660 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 10:35:51,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 10:35:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 10:35:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 27. [2019-01-12 10:35:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 10:35:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-12 10:35:51,669 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2019-01-12 10:35:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:51,669 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-12 10:35:51,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 10:35:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-12 10:35:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 10:35:51,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:51,671 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:51,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1224539237, now seen corresponding path program 4 times [2019-01-12 10:35:51,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:51,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:51,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:35:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:35:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:35:51,775 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:35:51,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:35:51 BoogieIcfgContainer [2019-01-12 10:35:51,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:35:51,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:35:51,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:35:51,816 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:35:51,817 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:46" (3/4) ... [2019-01-12 10:35:51,819 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 10:35:51,883 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:35:51,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:35:51,888 INFO L168 Benchmark]: Toolchain (without parser) took 7003.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:51,890 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:35:51,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 645.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:51,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:35:51,893 INFO L168 Benchmark]: Boogie Preprocessor took 35.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:35:51,894 INFO L168 Benchmark]: RCFGBuilder took 503.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:51,897 INFO L168 Benchmark]: TraceAbstraction took 5690.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:51,899 INFO L168 Benchmark]: Witness Printer took 70.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:35:51,905 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.40 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 645.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 503.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5690.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Witness Printer took 70.74 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L564] SLL head = ((void *)0); [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L572] len-- [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L572] len-- [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L572] len-- [L565] COND FALSE !(len > 0) [L574] return head; [L596] SLL s = sll_create(len + 1); [L577] int len = 0; [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) [L582] return len; [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. UNSAFE Result, 5.6s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 292 SDslu, 260 SDs, 0 SdLazy, 402 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, 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, 6 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 197 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 10730 SizeOfPredicates, 8 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 21/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...