java -ea -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:58:10,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:58:10,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:58:10,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:58:10,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:58:10,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:58:10,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:58:10,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:58:10,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:58:10,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:58:10,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:58:10,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:58:10,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:58:10,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:58:10,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:58:10,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:58:10,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:58:10,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:58:10,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:58:10,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:58:10,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:58:10,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:58:10,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:58:10,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:58:10,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:58:10,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:58:10,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:58:10,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:58:10,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:58:10,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:58:10,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:58:10,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:58:10,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:58:10,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:58:10,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:58:10,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:58:10,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:58:10,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:58:10,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:58:10,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:58:10,961 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:58:10,961 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:58:10,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:58:10,962 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:58:10,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:58:10,962 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:58:10,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:58:10,964 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:58:10,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:58:10,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:58:10,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:58:10,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:58:10,965 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:58:10,965 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:58:10,965 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:58:10,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:58:10,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:58:10,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:58:10,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:58:10,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:58:10,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:58:10,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:58:10,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:58:10,968 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:58:10,968 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:58:10,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:58:10,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:58:10,969 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:58:11,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:58:11,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:58:11,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:58:11,059 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:58:11,060 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:58:11,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:11,133 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bf903e1/84fc479c02fc48389dc7371b1cc89584/FLAGbbcee2f93 [2018-11-23 12:58:11,643 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:58:11,644 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:11,663 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bf903e1/84fc479c02fc48389dc7371b1cc89584/FLAGbbcee2f93 [2018-11-23 12:58:11,949 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bf903e1/84fc479c02fc48389dc7371b1cc89584 [2018-11-23 12:58:11,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:58:11,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:58:11,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:11,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:58:11,972 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:58:11,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:11" (1/1) ... [2018-11-23 12:58:11,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14dcd995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:11, skipping insertion in model container [2018-11-23 12:58:11,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:11" (1/1) ... [2018-11-23 12:58:11,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:58:12,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:58:12,576 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:12,589 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:58:12,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:12,759 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:58:12,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12 WrapperNode [2018-11-23 12:58:12,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:12,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:12,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:58:12,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:58:12,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:12,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:58:12,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:58:12,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:58:12,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (1/1) ... [2018-11-23 12:58:12,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:58:12,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:58:12,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:58:12,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:58:12,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58: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-11-23 12:58:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 12:58:13,052 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 12:58:13,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:58:13,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:58:13,054 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-23 12:58:13,054 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-23 12:58:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:58:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:58:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:58:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-23 12:58:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-23 12:58:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:58:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:58:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:58:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:58:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:58:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:58:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:58:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 12:58:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 12:58:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:58:13,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:58:14,080 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:58:14,081 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:58:14,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:14 BoogieIcfgContainer [2018-11-23 12:58:14,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:58:14,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:58:14,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:58:14,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:58:14,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:58:11" (1/3) ... [2018-11-23 12:58:14,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad4b499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:14, skipping insertion in model container [2018-11-23 12:58:14,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:12" (2/3) ... [2018-11-23 12:58:14,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad4b499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:14, skipping insertion in model container [2018-11-23 12:58:14,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:14" (3/3) ... [2018-11-23 12:58:14,091 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:14,102 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:58:14,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:58:14,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:58:14,162 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:58:14,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:58:14,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:58:14,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:58:14,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:58:14,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:58:14,163 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:58:14,163 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:58:14,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:58:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 12:58:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:58:14,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:14,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:14,194 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:14,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -529366065, now seen corresponding path program 1 times [2018-11-23 12:58:14,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:14,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:14,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-23 12:58:14,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54#true} is VALID [2018-11-23 12:58:14,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 12:58:14,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #138#return; {54#true} is VALID [2018-11-23 12:58:14,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret15 := main(); {54#true} is VALID [2018-11-23 12:58:14,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} ~len~0 := 2;~data~0 := 1; {56#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:14,543 INFO L256 TraceCheckUtils]: 6: Hoare triple {56#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {54#true} is VALID [2018-11-23 12:58:14,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {57#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:14,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {58#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:58:14,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:58:14,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(<= |dll_create_#in~len| 0)} assume true; {58#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:58:14,562 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#(<= |dll_create_#in~len| 0)} {56#(<= 2 main_~len~0)} #128#return; {55#false} is VALID [2018-11-23 12:58:14,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {55#false} is VALID [2018-11-23 12:58:14,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {55#false} assume !(~i~0 < ~len~0); {55#false} is VALID [2018-11-23 12:58:14,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:58:14,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {55#false} is VALID [2018-11-23 12:58:14,564 INFO L256 TraceCheckUtils]: 16: Hoare triple {55#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {54#true} is VALID [2018-11-23 12:58:14,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {54#true} is VALID [2018-11-23 12:58:14,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#true} assume !(~index > 0); {54#true} is VALID [2018-11-23 12:58:14,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {54#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {54#true} is VALID [2018-11-23 12:58:14,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 12:58:14,566 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {54#true} {55#false} #132#return; {55#false} is VALID [2018-11-23 12:58:14,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {55#false} is VALID [2018-11-23 12:58:14,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {55#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {55#false} is VALID [2018-11-23 12:58:14,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-23 12:58:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:14,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:14,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:58:14,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 12:58:14,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:14,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:58:14,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:14,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:58:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:58:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:58:14,783 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-11-23 12:58:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:15,822 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2018-11-23 12:58:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:58:15,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 12:58:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2018-11-23 12:58:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2018-11-23 12:58:15,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 126 transitions. [2018-11-23 12:58:16,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:16,151 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:58:16,151 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:58:16,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:58:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:58:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-23 12:58:16,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:16,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2018-11-23 12:58:16,247 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2018-11-23 12:58:16,247 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2018-11-23 12:58:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:16,253 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:58:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:58:16,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:16,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:16,254 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2018-11-23 12:58:16,254 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2018-11-23 12:58:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:16,260 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:58:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:58:16,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:16,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:16,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:16,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:58:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 12:58:16,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-11-23 12:58:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:16,267 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 12:58:16,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:58:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:58:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:58:16,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:16,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:16,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:16,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1904246888, now seen corresponding path program 1 times [2018-11-23 12:58:16,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:16,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:16,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:16,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:16,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 12:58:16,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 12:58:16,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 12:58:16,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #138#return; {336#true} is VALID [2018-11-23 12:58:16,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret15 := main(); {336#true} is VALID [2018-11-23 12:58:16,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#true} ~len~0 := 2;~data~0 := 1; {336#true} is VALID [2018-11-23 12:58:16,406 INFO L256 TraceCheckUtils]: 6: Hoare triple {336#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {336#true} is VALID [2018-11-23 12:58:16,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {336#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:58:16,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:58:16,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:58:16,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:58:16,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {337#false} is VALID [2018-11-23 12:58:16,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {337#false} is VALID [2018-11-23 12:58:16,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {337#false} assume !(~len > 0); {337#false} is VALID [2018-11-23 12:58:16,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {337#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {337#false} is VALID [2018-11-23 12:58:16,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {337#false} assume true; {337#false} is VALID [2018-11-23 12:58:16,419 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {337#false} {336#true} #128#return; {337#false} is VALID [2018-11-23 12:58:16,419 INFO L273 TraceCheckUtils]: 17: Hoare triple {337#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {337#false} is VALID [2018-11-23 12:58:16,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {337#false} assume !(~i~0 < ~len~0); {337#false} is VALID [2018-11-23 12:58:16,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:58:16,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {337#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {337#false} is VALID [2018-11-23 12:58:16,421 INFO L256 TraceCheckUtils]: 21: Hoare triple {337#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {336#true} is VALID [2018-11-23 12:58:16,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {336#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {336#true} is VALID [2018-11-23 12:58:16,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {336#true} assume !(~index > 0); {336#true} is VALID [2018-11-23 12:58:16,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {336#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {336#true} is VALID [2018-11-23 12:58:16,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 12:58:16,422 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {336#true} {337#false} #132#return; {337#false} is VALID [2018-11-23 12:58:16,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {337#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {337#false} is VALID [2018-11-23 12:58:16,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {337#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {337#false} is VALID [2018-11-23 12:58:16,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 12:58:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:58:16,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:58:16,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:16,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:58:16,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:16,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:58:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:58:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:58:16,483 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-23 12:58:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:16,667 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 12:58:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:58:16,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:58:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:58:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2018-11-23 12:58:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:58:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2018-11-23 12:58:16,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2018-11-23 12:58:16,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:16,867 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:58:16,868 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:58:16,869 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-11-23 12:58:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:58:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 12:58:16,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:16,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 12:58:16,916 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 12:58:16,917 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 12:58:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:16,920 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:58:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:58:16,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:16,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:16,921 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 12:58:16,922 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 12:58:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:16,925 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:58:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:58:16,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:16,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:16,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:16,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:58:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 12:58:16,930 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-11-23 12:58:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:16,930 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 12:58:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:58:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:58:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:58:16,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:16,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:16,932 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:16,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 215303146, now seen corresponding path program 1 times [2018-11-23 12:58:16,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:17,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2018-11-23 12:58:17,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {586#true} is VALID [2018-11-23 12:58:17,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2018-11-23 12:58:17,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #138#return; {586#true} is VALID [2018-11-23 12:58:17,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret15 := main(); {586#true} is VALID [2018-11-23 12:58:17,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#true} ~len~0 := 2;~data~0 := 1; {588#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:17,105 INFO L256 TraceCheckUtils]: 6: Hoare triple {588#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {586#true} is VALID [2018-11-23 12:58:17,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {590#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:58:17,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {590#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {591#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:58:17,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {591#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {591#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:58:17,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {591#(<= |dll_create_#in~len| 1)} assume true; {591#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:58:17,118 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {591#(<= |dll_create_#in~len| 1)} {588#(<= 2 main_~len~0)} #128#return; {587#false} is VALID [2018-11-23 12:58:17,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {587#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {587#false} is VALID [2018-11-23 12:58:17,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {587#false} assume !(~i~0 < ~len~0); {587#false} is VALID [2018-11-23 12:58:17,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {587#false} ~i~0 := 0; {587#false} is VALID [2018-11-23 12:58:17,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {587#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {587#false} is VALID [2018-11-23 12:58:17,119 INFO L256 TraceCheckUtils]: 21: Hoare triple {587#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {586#true} is VALID [2018-11-23 12:58:17,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {586#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {586#true} is VALID [2018-11-23 12:58:17,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {586#true} assume !(~index > 0); {586#true} is VALID [2018-11-23 12:58:17,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {586#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {586#true} is VALID [2018-11-23 12:58:17,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {586#true} assume true; {586#true} is VALID [2018-11-23 12:58:17,121 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {586#true} {587#false} #132#return; {587#false} is VALID [2018-11-23 12:58:17,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {587#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {587#false} is VALID [2018-11-23 12:58:17,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {587#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {587#false} is VALID [2018-11-23 12:58:17,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {587#false} assume !false; {587#false} is VALID [2018-11-23 12:58:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:17,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:17,126 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-11-23 12:58:17,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:17,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:17,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2018-11-23 12:58:17,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {586#true} is VALID [2018-11-23 12:58:17,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2018-11-23 12:58:17,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #138#return; {586#true} is VALID [2018-11-23 12:58:17,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret15 := main(); {586#true} is VALID [2018-11-23 12:58:17,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#true} ~len~0 := 2;~data~0 := 1; {588#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:17,548 INFO L256 TraceCheckUtils]: 6: Hoare triple {588#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {586#true} is VALID [2018-11-23 12:58:17,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {589#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:58:17,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {590#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:58:17,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {590#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {591#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:58:17,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {591#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {591#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:58:17,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {591#(<= |dll_create_#in~len| 1)} assume true; {591#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:58:17,578 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {591#(<= |dll_create_#in~len| 1)} {588#(<= 2 main_~len~0)} #128#return; {587#false} is VALID [2018-11-23 12:58:17,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {587#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {587#false} is VALID [2018-11-23 12:58:17,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {587#false} assume !(~i~0 < ~len~0); {587#false} is VALID [2018-11-23 12:58:17,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {587#false} ~i~0 := 0; {587#false} is VALID [2018-11-23 12:58:17,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {587#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {587#false} is VALID [2018-11-23 12:58:17,580 INFO L256 TraceCheckUtils]: 21: Hoare triple {587#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {587#false} is VALID [2018-11-23 12:58:17,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {587#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {587#false} is VALID [2018-11-23 12:58:17,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {587#false} assume !(~index > 0); {587#false} is VALID [2018-11-23 12:58:17,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {587#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {587#false} is VALID [2018-11-23 12:58:17,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {587#false} assume true; {587#false} is VALID [2018-11-23 12:58:17,582 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {587#false} {587#false} #132#return; {587#false} is VALID [2018-11-23 12:58:17,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {587#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {587#false} is VALID [2018-11-23 12:58:17,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {587#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {587#false} is VALID [2018-11-23 12:58:17,582 INFO L273 TraceCheckUtils]: 29: Hoare triple {587#false} assume !false; {587#false} is VALID [2018-11-23 12:58:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:17,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:17,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:58:17,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 12:58:17,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:17,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:58:17,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:17,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:58:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:58:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:58:17,749 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 6 states. [2018-11-23 12:58:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:18,125 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 12:58:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:58:18,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 12:58:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:58:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 12:58:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:58:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 12:58:18,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2018-11-23 12:58:18,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:18,333 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:58:18,333 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:58:18,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:58:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:58:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 12:58:18,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:18,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-23 12:58:18,367 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-23 12:58:18,368 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-23 12:58:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:18,371 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:58:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:58:18,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:18,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:18,372 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-23 12:58:18,372 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-23 12:58:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:18,375 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:58:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:58:18,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:18,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:18,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:18,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:58:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 12:58:18,380 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2018-11-23 12:58:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:18,380 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 12:58:18,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:58:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:58:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:58:18,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:18,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:18,383 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:18,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2098685651, now seen corresponding path program 1 times [2018-11-23 12:58:18,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:18,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:18,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {941#true} is VALID [2018-11-23 12:58:18,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {941#true} is VALID [2018-11-23 12:58:18,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2018-11-23 12:58:18,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #138#return; {941#true} is VALID [2018-11-23 12:58:18,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret15 := main(); {941#true} is VALID [2018-11-23 12:58:18,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {941#true} ~len~0 := 2;~data~0 := 1; {943#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:18,572 INFO L256 TraceCheckUtils]: 6: Hoare triple {943#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {941#true} is VALID [2018-11-23 12:58:18,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {941#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {941#true} is VALID [2018-11-23 12:58:18,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {941#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {941#true} is VALID [2018-11-23 12:58:18,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {941#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {941#true} is VALID [2018-11-23 12:58:18,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {941#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {941#true} is VALID [2018-11-23 12:58:18,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {941#true} is VALID [2018-11-23 12:58:18,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {941#true} is VALID [2018-11-23 12:58:18,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {941#true} is VALID [2018-11-23 12:58:18,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {941#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {941#true} is VALID [2018-11-23 12:58:18,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {941#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {941#true} is VALID [2018-11-23 12:58:18,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {941#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {941#true} is VALID [2018-11-23 12:58:18,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {941#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {941#true} is VALID [2018-11-23 12:58:18,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {941#true} assume !(~len > 0); {941#true} is VALID [2018-11-23 12:58:18,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {941#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {941#true} is VALID [2018-11-23 12:58:18,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {941#true} assume true; {941#true} is VALID [2018-11-23 12:58:18,588 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {941#true} {943#(<= 2 main_~len~0)} #128#return; {943#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:18,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {943#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {944#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:18,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {944#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {942#false} is VALID [2018-11-23 12:58:18,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {942#false} ~i~0 := 0; {942#false} is VALID [2018-11-23 12:58:18,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {942#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {942#false} is VALID [2018-11-23 12:58:18,598 INFO L256 TraceCheckUtils]: 26: Hoare triple {942#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {941#true} is VALID [2018-11-23 12:58:18,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {941#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {941#true} is VALID [2018-11-23 12:58:18,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {941#true} assume !(~index > 0); {941#true} is VALID [2018-11-23 12:58:18,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {941#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {941#true} is VALID [2018-11-23 12:58:18,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {941#true} assume true; {941#true} is VALID [2018-11-23 12:58:18,599 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {941#true} {942#false} #132#return; {942#false} is VALID [2018-11-23 12:58:18,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {942#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {942#false} is VALID [2018-11-23 12:58:18,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {942#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {942#false} is VALID [2018-11-23 12:58:18,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {942#false} assume !false; {942#false} is VALID [2018-11-23 12:58:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:58:18,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:18,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:58:18,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 12:58:18,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:18,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:58:18,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:18,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:58:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:58:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:58:18,656 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-11-23 12:58:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:18,922 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 12:58:18,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:58:18,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 12:58:18,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:58:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:58:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:58:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:58:18,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:58:19,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:19,052 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:58:19,052 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:58:19,053 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 [2018-11-23 12:58:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:58:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 12:58:19,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:19,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 45 states. [2018-11-23 12:58:19,143 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 45 states. [2018-11-23 12:58:19,143 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 45 states. [2018-11-23 12:58:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:19,148 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:58:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:58:19,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:19,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:19,149 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 54 states. [2018-11-23 12:58:19,149 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 54 states. [2018-11-23 12:58:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:19,153 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:58:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:58:19,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:19,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:19,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:19,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:58:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-23 12:58:19,157 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2018-11-23 12:58:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:19,158 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-23 12:58:19,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:58:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 12:58:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:58:19,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:19,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:19,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:19,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1453975145, now seen corresponding path program 1 times [2018-11-23 12:58:19,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:19,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:19,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:19,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {1214#true} call ULTIMATE.init(); {1214#true} is VALID [2018-11-23 12:58:19,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {1214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1214#true} is VALID [2018-11-23 12:58:19,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1214#true} {1214#true} #138#return; {1214#true} is VALID [2018-11-23 12:58:19,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {1214#true} call #t~ret15 := main(); {1214#true} is VALID [2018-11-23 12:58:19,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {1214#true} ~len~0 := 2;~data~0 := 1; {1216#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:19,470 INFO L256 TraceCheckUtils]: 6: Hoare triple {1216#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1214#true} is VALID [2018-11-23 12:58:19,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {1214#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1214#true} is VALID [2018-11-23 12:58:19,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {1214#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1214#true} is VALID [2018-11-23 12:58:19,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {1214#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1214#true} is VALID [2018-11-23 12:58:19,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {1214#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {1214#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1214#true} is VALID [2018-11-23 12:58:19,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {1214#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1214#true} is VALID [2018-11-23 12:58:19,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {1214#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1214#true} is VALID [2018-11-23 12:58:19,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {1214#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1214#true} is VALID [2018-11-23 12:58:19,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {1214#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {1214#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {1214#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1214#true} is VALID [2018-11-23 12:58:19,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {1214#true} assume !(~len > 0); {1214#true} is VALID [2018-11-23 12:58:19,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {1214#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1214#true} is VALID [2018-11-23 12:58:19,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,475 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1214#true} {1216#(<= 2 main_~len~0)} #128#return; {1216#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:19,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:19,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:19,476 INFO L256 TraceCheckUtils]: 24: Hoare triple {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1214#true} is VALID [2018-11-23 12:58:19,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {1214#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1214#true} is VALID [2018-11-23 12:58:19,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {1214#true} assume !(~index > 0); {1214#true} is VALID [2018-11-23 12:58:19,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {1214#true} call write~int(~data, ~head.base, ~head.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,484 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1214#true} {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} #130#return; {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:19,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {1217#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1218#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:58:19,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {1218#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1215#false} is VALID [2018-11-23 12:58:19,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {1215#false} ~i~0 := 0; {1215#false} is VALID [2018-11-23 12:58:19,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {1215#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1215#false} is VALID [2018-11-23 12:58:19,486 INFO L256 TraceCheckUtils]: 34: Hoare triple {1215#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1214#true} is VALID [2018-11-23 12:58:19,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {1214#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1214#true} is VALID [2018-11-23 12:58:19,487 INFO L273 TraceCheckUtils]: 36: Hoare triple {1214#true} assume !(~index > 0); {1214#true} is VALID [2018-11-23 12:58:19,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {1214#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1214#true} is VALID [2018-11-23 12:58:19,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,488 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1214#true} {1215#false} #132#return; {1215#false} is VALID [2018-11-23 12:58:19,488 INFO L273 TraceCheckUtils]: 40: Hoare triple {1215#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1215#false} is VALID [2018-11-23 12:58:19,488 INFO L273 TraceCheckUtils]: 41: Hoare triple {1215#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1215#false} is VALID [2018-11-23 12:58:19,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {1215#false} assume !false; {1215#false} is VALID [2018-11-23 12:58:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:58:19,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:19,492 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-11-23 12:58:19,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:19,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:19,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {1214#true} call ULTIMATE.init(); {1214#true} is VALID [2018-11-23 12:58:19,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {1214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1214#true} is VALID [2018-11-23 12:58:19,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1214#true} {1214#true} #138#return; {1214#true} is VALID [2018-11-23 12:58:19,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {1214#true} call #t~ret15 := main(); {1214#true} is VALID [2018-11-23 12:58:19,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {1214#true} ~len~0 := 2;~data~0 := 1; {1216#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:19,712 INFO L256 TraceCheckUtils]: 6: Hoare triple {1216#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1214#true} is VALID [2018-11-23 12:58:19,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {1214#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1214#true} is VALID [2018-11-23 12:58:19,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {1214#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1214#true} is VALID [2018-11-23 12:58:19,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {1214#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1214#true} is VALID [2018-11-23 12:58:19,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {1214#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {1214#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1214#true} is VALID [2018-11-23 12:58:19,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {1214#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1214#true} is VALID [2018-11-23 12:58:19,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {1214#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1214#true} is VALID [2018-11-23 12:58:19,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {1214#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1214#true} is VALID [2018-11-23 12:58:19,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {1214#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {1214#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {1214#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1214#true} is VALID [2018-11-23 12:58:19,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {1214#true} assume !(~len > 0); {1214#true} is VALID [2018-11-23 12:58:19,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {1214#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1214#true} is VALID [2018-11-23 12:58:19,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,727 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1214#true} {1216#(<= 2 main_~len~0)} #128#return; {1216#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:19,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:19,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:19,729 INFO L256 TraceCheckUtils]: 24: Hoare triple {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1214#true} is VALID [2018-11-23 12:58:19,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {1214#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1214#true} is VALID [2018-11-23 12:58:19,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {1214#true} assume !(~index > 0); {1214#true} is VALID [2018-11-23 12:58:19,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {1214#true} call write~int(~data, ~head.base, ~head.offset, 4); {1214#true} is VALID [2018-11-23 12:58:19,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 12:58:19,731 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1214#true} {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #130#return; {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:19,732 INFO L273 TraceCheckUtils]: 30: Hoare triple {1288#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1313#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:19,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {1215#false} is VALID [2018-11-23 12:58:19,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {1215#false} ~i~0 := 0; {1215#false} is VALID [2018-11-23 12:58:19,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {1215#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1215#false} is VALID [2018-11-23 12:58:19,733 INFO L256 TraceCheckUtils]: 34: Hoare triple {1215#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1215#false} is VALID [2018-11-23 12:58:19,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {1215#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1215#false} is VALID [2018-11-23 12:58:19,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {1215#false} assume !(~index > 0); {1215#false} is VALID [2018-11-23 12:58:19,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {1215#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1215#false} is VALID [2018-11-23 12:58:19,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {1215#false} assume true; {1215#false} is VALID [2018-11-23 12:58:19,734 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1215#false} {1215#false} #132#return; {1215#false} is VALID [2018-11-23 12:58:19,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {1215#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1215#false} is VALID [2018-11-23 12:58:19,735 INFO L273 TraceCheckUtils]: 41: Hoare triple {1215#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1215#false} is VALID [2018-11-23 12:58:19,735 INFO L273 TraceCheckUtils]: 42: Hoare triple {1215#false} assume !false; {1215#false} is VALID [2018-11-23 12:58:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:58:19,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:19,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 12:58:19,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-23 12:58:19,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:19,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:58:19,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:19,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:58:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:58:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:58:19,821 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2018-11-23 12:58:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:20,347 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-23 12:58:20,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:58:20,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-23 12:58:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:58:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-23 12:58:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:58:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-23 12:58:20,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2018-11-23 12:58:20,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:20,608 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:58:20,608 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:58:20,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:58:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:58:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-23 12:58:20,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:20,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 48 states. [2018-11-23 12:58:20,671 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 48 states. [2018-11-23 12:58:20,671 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 48 states. [2018-11-23 12:58:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:20,677 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 12:58:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 12:58:20,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:20,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:20,678 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 64 states. [2018-11-23 12:58:20,678 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 64 states. [2018-11-23 12:58:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:20,682 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 12:58:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 12:58:20,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:20,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:20,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:20,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:58:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-23 12:58:20,686 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2018-11-23 12:58:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:20,687 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-23 12:58:20,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:58:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:58:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:58:20,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:20,689 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:20,689 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:20,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1365667839, now seen corresponding path program 2 times [2018-11-23 12:58:20,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:20,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:20,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:20,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {1658#true} call ULTIMATE.init(); {1658#true} is VALID [2018-11-23 12:58:20,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {1658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1658#true} is VALID [2018-11-23 12:58:20,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:20,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1658#true} {1658#true} #138#return; {1658#true} is VALID [2018-11-23 12:58:20,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {1658#true} call #t~ret15 := main(); {1658#true} is VALID [2018-11-23 12:58:20,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {1658#true} ~len~0 := 2;~data~0 := 1; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,873 INFO L256 TraceCheckUtils]: 6: Hoare triple {1660#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1658#true} is VALID [2018-11-23 12:58:20,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {1658#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1658#true} is VALID [2018-11-23 12:58:20,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {1658#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1658#true} is VALID [2018-11-23 12:58:20,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {1658#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1658#true} is VALID [2018-11-23 12:58:20,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {1658#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1658#true} is VALID [2018-11-23 12:58:20,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {1658#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1658#true} is VALID [2018-11-23 12:58:20,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {1658#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1658#true} is VALID [2018-11-23 12:58:20,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {1658#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1658#true} is VALID [2018-11-23 12:58:20,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1658#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1658#true} is VALID [2018-11-23 12:58:20,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {1658#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1658#true} is VALID [2018-11-23 12:58:20,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {1658#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1658#true} is VALID [2018-11-23 12:58:20,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {1658#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1658#true} is VALID [2018-11-23 12:58:20,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {1658#true} assume !(~len > 0); {1658#true} is VALID [2018-11-23 12:58:20,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {1658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1658#true} is VALID [2018-11-23 12:58:20,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:20,885 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1658#true} {1660#(<= 2 main_~len~0)} #128#return; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {1660#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {1660#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,888 INFO L256 TraceCheckUtils]: 24: Hoare triple {1660#(<= 2 main_~len~0)} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1658#true} is VALID [2018-11-23 12:58:20,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {1658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1658#true} is VALID [2018-11-23 12:58:20,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {1658#true} assume !(~index > 0); {1658#true} is VALID [2018-11-23 12:58:20,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {1658#true} call write~int(~data, ~head.base, ~head.offset, 4); {1658#true} is VALID [2018-11-23 12:58:20,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:20,889 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1658#true} {1660#(<= 2 main_~len~0)} #130#return; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {1660#(<= 2 main_~len~0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,890 INFO L273 TraceCheckUtils]: 31: Hoare triple {1660#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1660#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:20,891 INFO L256 TraceCheckUtils]: 32: Hoare triple {1660#(<= 2 main_~len~0)} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1658#true} is VALID [2018-11-23 12:58:20,891 INFO L273 TraceCheckUtils]: 33: Hoare triple {1658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1661#(<= |dll_update_at_#in~index| dll_update_at_~index)} is VALID [2018-11-23 12:58:20,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {1661#(<= |dll_update_at_#in~index| dll_update_at_~index)} assume !(~index > 0); {1662#(<= |dll_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:20,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#(<= |dll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset, 4); {1662#(<= |dll_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:20,893 INFO L273 TraceCheckUtils]: 36: Hoare triple {1662#(<= |dll_update_at_#in~index| 0)} assume true; {1662#(<= |dll_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:20,895 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1662#(<= |dll_update_at_#in~index| 0)} {1660#(<= 2 main_~len~0)} #130#return; {1663#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2018-11-23 12:58:20,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {1663#(<= (+ main_~i~0 2) main_~len~0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1664#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:58:20,897 INFO L273 TraceCheckUtils]: 39: Hoare triple {1664#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1659#false} is VALID [2018-11-23 12:58:20,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {1659#false} ~i~0 := 0; {1659#false} is VALID [2018-11-23 12:58:20,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {1659#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1659#false} is VALID [2018-11-23 12:58:20,898 INFO L256 TraceCheckUtils]: 42: Hoare triple {1659#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1658#true} is VALID [2018-11-23 12:58:20,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {1658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1658#true} is VALID [2018-11-23 12:58:20,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {1658#true} assume !(~index > 0); {1658#true} is VALID [2018-11-23 12:58:20,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {1658#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1658#true} is VALID [2018-11-23 12:58:20,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:20,901 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1658#true} {1659#false} #132#return; {1659#false} is VALID [2018-11-23 12:58:20,901 INFO L273 TraceCheckUtils]: 48: Hoare triple {1659#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1659#false} is VALID [2018-11-23 12:58:20,901 INFO L273 TraceCheckUtils]: 49: Hoare triple {1659#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1659#false} is VALID [2018-11-23 12:58:20,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {1659#false} assume !false; {1659#false} is VALID [2018-11-23 12:58:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:58:20,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:20,905 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-11-23 12:58:20,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:58:20,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:58:20,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:58:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:20,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:21,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {1658#true} call ULTIMATE.init(); {1658#true} is VALID [2018-11-23 12:58:21,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {1658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1658#true} is VALID [2018-11-23 12:58:21,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:21,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1658#true} {1658#true} #138#return; {1658#true} is VALID [2018-11-23 12:58:21,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {1658#true} call #t~ret15 := main(); {1658#true} is VALID [2018-11-23 12:58:21,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {1658#true} ~len~0 := 2;~data~0 := 1; {1658#true} is VALID [2018-11-23 12:58:21,125 INFO L256 TraceCheckUtils]: 6: Hoare triple {1658#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1658#true} is VALID [2018-11-23 12:58:21,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {1658#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1658#true} is VALID [2018-11-23 12:58:21,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {1658#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1658#true} is VALID [2018-11-23 12:58:21,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {1658#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1658#true} is VALID [2018-11-23 12:58:21,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1658#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1658#true} is VALID [2018-11-23 12:58:21,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {1658#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1658#true} is VALID [2018-11-23 12:58:21,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {1658#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1658#true} is VALID [2018-11-23 12:58:21,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {1658#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1658#true} is VALID [2018-11-23 12:58:21,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {1658#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1658#true} is VALID [2018-11-23 12:58:21,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {1658#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1658#true} is VALID [2018-11-23 12:58:21,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {1658#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1658#true} is VALID [2018-11-23 12:58:21,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {1658#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1658#true} is VALID [2018-11-23 12:58:21,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {1658#true} assume !(~len > 0); {1658#true} is VALID [2018-11-23 12:58:21,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {1658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1658#true} is VALID [2018-11-23 12:58:21,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:21,128 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1658#true} {1658#true} #128#return; {1658#true} is VALID [2018-11-23 12:58:21,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {1658#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1734#(<= 0 main_~i~0)} is VALID [2018-11-23 12:58:21,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {1734#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1734#(<= 0 main_~i~0)} is VALID [2018-11-23 12:58:21,129 INFO L256 TraceCheckUtils]: 24: Hoare triple {1734#(<= 0 main_~i~0)} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1658#true} is VALID [2018-11-23 12:58:21,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {1658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1658#true} is VALID [2018-11-23 12:58:21,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {1658#true} assume !(~index > 0); {1658#true} is VALID [2018-11-23 12:58:21,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {1658#true} call write~int(~data, ~head.base, ~head.offset, 4); {1658#true} is VALID [2018-11-23 12:58:21,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {1658#true} assume true; {1658#true} is VALID [2018-11-23 12:58:21,131 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1658#true} {1734#(<= 0 main_~i~0)} #130#return; {1734#(<= 0 main_~i~0)} is VALID [2018-11-23 12:58:21,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {1734#(<= 0 main_~i~0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1759#(<= 1 main_~i~0)} is VALID [2018-11-23 12:58:21,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {1759#(<= 1 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1759#(<= 1 main_~i~0)} is VALID [2018-11-23 12:58:21,133 INFO L256 TraceCheckUtils]: 32: Hoare triple {1759#(<= 1 main_~i~0)} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1658#true} is VALID [2018-11-23 12:58:21,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {1658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1661#(<= |dll_update_at_#in~index| dll_update_at_~index)} is VALID [2018-11-23 12:58:21,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {1661#(<= |dll_update_at_#in~index| dll_update_at_~index)} assume !(~index > 0); {1662#(<= |dll_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:21,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#(<= |dll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset, 4); {1662#(<= |dll_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:21,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {1662#(<= |dll_update_at_#in~index| 0)} assume true; {1662#(<= |dll_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:21,142 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1662#(<= |dll_update_at_#in~index| 0)} {1759#(<= 1 main_~i~0)} #130#return; {1659#false} is VALID [2018-11-23 12:58:21,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {1659#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1659#false} is VALID [2018-11-23 12:58:21,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {1659#false} assume !(~i~0 < ~len~0); {1659#false} is VALID [2018-11-23 12:58:21,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {1659#false} ~i~0 := 0; {1659#false} is VALID [2018-11-23 12:58:21,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {1659#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1659#false} is VALID [2018-11-23 12:58:21,143 INFO L256 TraceCheckUtils]: 42: Hoare triple {1659#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1659#false} is VALID [2018-11-23 12:58:21,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {1659#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1659#false} is VALID [2018-11-23 12:58:21,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {1659#false} assume !(~index > 0); {1659#false} is VALID [2018-11-23 12:58:21,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {1659#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1659#false} is VALID [2018-11-23 12:58:21,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {1659#false} assume true; {1659#false} is VALID [2018-11-23 12:58:21,145 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1659#false} {1659#false} #132#return; {1659#false} is VALID [2018-11-23 12:58:21,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {1659#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1659#false} is VALID [2018-11-23 12:58:21,145 INFO L273 TraceCheckUtils]: 49: Hoare triple {1659#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1659#false} is VALID [2018-11-23 12:58:21,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {1659#false} assume !false; {1659#false} is VALID [2018-11-23 12:58:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:58:21,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:58:21,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 12:58:21,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-23 12:58:21,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:21,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:58:21,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:21,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:58:21,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:58:21,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:58:21,304 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-11-23 12:58:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:22,336 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-23 12:58:22,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:58:22,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-23 12:58:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:58:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-23 12:58:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:58:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-23 12:58:22,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2018-11-23 12:58:22,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:22,454 INFO L225 Difference]: With dead ends: 81 [2018-11-23 12:58:22,454 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:58:22,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:58:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:58:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-23 12:58:22,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:22,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-23 12:58:22,509 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-23 12:58:22,510 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-23 12:58:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:22,513 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:58:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:58:22,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:22,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:22,514 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-23 12:58:22,514 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-23 12:58:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:22,517 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:58:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:58:22,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:22,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:22,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:22,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:58:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 12:58:22,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 51 [2018-11-23 12:58:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:22,521 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 12:58:22,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:58:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:58:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:58:22,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:22,523 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:22,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:22,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1018565616, now seen corresponding path program 1 times [2018-11-23 12:58:22,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:22,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:22,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:23,066 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:58:23,072 INFO L168 Benchmark]: Toolchain (without parser) took 11107.15 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -741.6 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:23,073 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:23,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:23,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:23,076 INFO L168 Benchmark]: Boogie Preprocessor took 89.40 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:23,076 INFO L168 Benchmark]: RCFGBuilder took 1104.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:23,077 INFO L168 Benchmark]: TraceAbstraction took 8987.22 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 142.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -12.3 MB). Peak memory consumption was 129.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:23,082 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.40 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1104.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8987.22 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 142.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -12.3 MB). Peak memory consumption was 129.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...