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/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:56:34,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:56:34,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:56:34,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:56:34,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:56:34,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:56:34,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:56:34,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:56:34,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:56:34,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:56:34,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:56:34,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:56:34,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:56:34,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:56:34,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:56:34,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:56:34,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:56:34,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:56:34,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:56:34,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:56:34,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:56:34,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:56:34,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:56:34,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:56:34,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:56:34,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:56:34,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:56:34,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:56:34,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:56:34,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:56:34,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:56:34,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:56:34,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:56:34,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:56:34,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:56:34,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:56:34,207 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:56:34,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:56:34,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:56:34,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:56:34,232 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:56:34,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:56:34,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:56:34,233 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:56:34,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:56:34,234 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:56:34,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:56:34,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:56:34,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:56:34,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:56:34,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:56:34,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:56:34,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:56:34,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:56:34,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:56:34,236 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:56:34,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:56:34,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:56:34,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:56:34,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:56:34,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:56:34,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:56:34,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:56:34,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:56:34,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:56:34,239 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:56:34,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:56:34,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:56:34,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:56:34,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:56:34,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:56:34,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:56:34,323 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:56:34,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:34,386 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9732b0f/249517b5543f4cb09195ea56e58af54e/FLAG7bbd717bb [2018-11-23 12:56:34,938 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:56:34,939 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:34,955 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9732b0f/249517b5543f4cb09195ea56e58af54e/FLAG7bbd717bb [2018-11-23 12:56:35,225 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9732b0f/249517b5543f4cb09195ea56e58af54e [2018-11-23 12:56:35,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:56:35,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:56:35,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:35,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:56:35,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:56:35,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:35,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e6de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35, skipping insertion in model container [2018-11-23 12:56:35,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:35,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:56:35,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:56:35,734 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:35,750 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:56:35,857 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:35,930 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:56:35,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35 WrapperNode [2018-11-23 12:56:35,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:35,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:35,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:56:35,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:56:36,017 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:56:35" (1/1) ... [2018-11-23 12:56:36,034 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:56:35" (1/1) ... [2018-11-23 12:56:36,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:36,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:56:36,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:56:36,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:56:36,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (1/1) ... [2018-11-23 12:56:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:56:36,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:56:36,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:56:36,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:56:36,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (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:56:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 12:56:36,162 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 12:56:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:56:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:56:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:56:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:56:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:56:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:56:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:56:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:56:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:56:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:56:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:56:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-11-23 12:56:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-11-23 12:56:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:56:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:56:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:56:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:56:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:56:37,193 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:56:37,193 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:56:37,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:37 BoogieIcfgContainer [2018-11-23 12:56:37,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:56:37,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:56:37,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:56:37,199 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:56:37,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:56:35" (1/3) ... [2018-11-23 12:56:37,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c58ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:37, skipping insertion in model container [2018-11-23 12:56:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:35" (2/3) ... [2018-11-23 12:56:37,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c58ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:37, skipping insertion in model container [2018-11-23 12:56:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:37" (3/3) ... [2018-11-23 12:56:37,203 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:37,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:56:37,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:56:37,242 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:56:37,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:56:37,273 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:56:37,273 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:56:37,273 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:56:37,273 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:56:37,273 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:56:37,274 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:56:37,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:56:37,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:56:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:56:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:56:37,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:37,300 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] [2018-11-23 12:56:37,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:37,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 455397565, now seen corresponding path program 1 times [2018-11-23 12:56:37,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:37,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:37,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 12:56:37,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-23 12:56:37,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 12:56:37,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #89#return; {45#true} is VALID [2018-11-23 12:56:37,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret16 := main(); {45#true} is VALID [2018-11-23 12:56:37,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {45#true} is VALID [2018-11-23 12:56:37,526 INFO L256 TraceCheckUtils]: 6: Hoare triple {45#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {45#true} is VALID [2018-11-23 12:56:37,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#true} ~len := #in~len;~data := #in~data; {45#true} is VALID [2018-11-23 12:56:37,527 INFO L256 TraceCheckUtils]: 8: Hoare triple {45#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {45#true} is VALID [2018-11-23 12:56:37,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {45#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {45#true} is VALID [2018-11-23 12:56:37,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {45#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {45#true} is VALID [2018-11-23 12:56:37,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {45#true} is VALID [2018-11-23 12:56:37,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 12:56:37,529 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {45#true} {45#true} #85#return; {45#true} is VALID [2018-11-23 12:56:37,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {45#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {45#true} is VALID [2018-11-23 12:56:37,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 12:56:37,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {46#false} is VALID [2018-11-23 12:56:37,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-23 12:56:37,544 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {46#false} {45#true} #81#return; {46#false} is VALID [2018-11-23 12:56:37,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {46#false} is VALID [2018-11-23 12:56:37,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume !(~i~0 < ~len~0); {46#false} is VALID [2018-11-23 12:56:37,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {46#false} is VALID [2018-11-23 12:56:37,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {46#false} is VALID [2018-11-23 12:56:37,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 12:56:37,551 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:56:37,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:37,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:56:37,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 12:56:37,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:37,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:56:37,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:37,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:56:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:56:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:56:37,792 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:56:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:38,089 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 12:56:38,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:56:38,090 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 12:56:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2018-11-23 12:56:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2018-11-23 12:56:38,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2018-11-23 12:56:38,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:38,401 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:56:38,403 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:56:38,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:56:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:56:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 12:56:38,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:38,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 12:56:38,633 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:56:38,633 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:56:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:38,652 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:56:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:56:38,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:38,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:38,654 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:56:38,654 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:56:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:38,664 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:56:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:56:38,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:38,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:38,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:38,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:56:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 12:56:38,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-11-23 12:56:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:38,676 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 12:56:38,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:56:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:56:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:56:38,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:38,681 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] [2018-11-23 12:56:38,681 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:38,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:38,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1817498192, now seen corresponding path program 1 times [2018-11-23 12:56:38,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:38,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:38,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-23 12:56:38,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {250#true} is VALID [2018-11-23 12:56:38,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-23 12:56:38,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {250#true} {250#true} #89#return; {250#true} is VALID [2018-11-23 12:56:38,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {250#true} call #t~ret16 := main(); {250#true} is VALID [2018-11-23 12:56:38,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {250#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {252#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:38,993 INFO L256 TraceCheckUtils]: 6: Hoare triple {252#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {250#true} is VALID [2018-11-23 12:56:39,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {250#true} ~len := #in~len;~data := #in~data; {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 12:56:39,007 INFO L256 TraceCheckUtils]: 8: Hoare triple {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {250#true} is VALID [2018-11-23 12:56:39,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {250#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {250#true} is VALID [2018-11-23 12:56:39,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {250#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {250#true} is VALID [2018-11-23 12:56:39,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {250#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {250#true} is VALID [2018-11-23 12:56:39,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-23 12:56:39,013 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {250#true} {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} #85#return; {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 12:56:39,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 12:56:39,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {253#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !(~len > 1); {254#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:56:39,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {254#(<= |dll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {254#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:56:39,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {254#(<= |dll_circular_create_#in~len| 1)} assume true; {254#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:56:39,020 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {254#(<= |dll_circular_create_#in~len| 1)} {252#(<= 2 main_~len~0)} #81#return; {251#false} is VALID [2018-11-23 12:56:39,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {251#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {251#false} is VALID [2018-11-23 12:56:39,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {251#false} assume !(~i~0 < ~len~0); {251#false} is VALID [2018-11-23 12:56:39,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {251#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {251#false} is VALID [2018-11-23 12:56:39,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {251#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {251#false} is VALID [2018-11-23 12:56:39,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-23 12:56:39,026 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:56:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:39,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:39,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:56:39,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:39,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:39,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:39,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:39,148 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-23 12:56:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:39,557 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:56:39,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:39,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:56:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 12:56:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 12:56:39,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-23 12:56:39,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:39,713 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:56:39,713 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:56:39,714 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:56:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:56:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 12:56:39,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:39,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 12:56:39,746 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 12:56:39,746 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 12:56:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:39,750 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 12:56:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:56:39,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:39,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:39,752 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 12:56:39,752 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 12:56:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:39,756 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 12:56:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:56:39,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:39,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:39,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:39,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:56:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 12:56:39,763 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-11-23 12:56:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:39,764 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 12:56:39,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:56:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:56:39,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:39,768 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] [2018-11-23 12:56:39,769 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:39,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1351483172, now seen corresponding path program 1 times [2018-11-23 12:56:39,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:39,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:39,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-23 12:56:39,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {465#true} is VALID [2018-11-23 12:56:39,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 12:56:39,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #89#return; {465#true} is VALID [2018-11-23 12:56:39,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret16 := main(); {465#true} is VALID [2018-11-23 12:56:39,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {467#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:39,951 INFO L256 TraceCheckUtils]: 6: Hoare triple {467#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {465#true} is VALID [2018-11-23 12:56:39,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {465#true} ~len := #in~len;~data := #in~data; {465#true} is VALID [2018-11-23 12:56:39,951 INFO L256 TraceCheckUtils]: 8: Hoare triple {465#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {465#true} is VALID [2018-11-23 12:56:39,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {465#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {465#true} is VALID [2018-11-23 12:56:39,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {465#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {465#true} is VALID [2018-11-23 12:56:39,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {465#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {465#true} is VALID [2018-11-23 12:56:39,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 12:56:39,953 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {465#true} {465#true} #85#return; {465#true} is VALID [2018-11-23 12:56:39,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {465#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {465#true} is VALID [2018-11-23 12:56:39,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {465#true} assume !!(~len > 1); {465#true} is VALID [2018-11-23 12:56:39,953 INFO L256 TraceCheckUtils]: 16: Hoare triple {465#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {465#true} is VALID [2018-11-23 12:56:39,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {465#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {465#true} is VALID [2018-11-23 12:56:39,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {465#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {465#true} is VALID [2018-11-23 12:56:39,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {465#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {465#true} is VALID [2018-11-23 12:56:39,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 12:56:39,955 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {465#true} {465#true} #87#return; {465#true} is VALID [2018-11-23 12:56:39,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {465#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {465#true} is VALID [2018-11-23 12:56:39,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {465#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {465#true} is VALID [2018-11-23 12:56:39,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {465#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {465#true} is VALID [2018-11-23 12:56:39,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {465#true} assume !(~len > 1); {465#true} is VALID [2018-11-23 12:56:39,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {465#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {465#true} is VALID [2018-11-23 12:56:39,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 12:56:39,958 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {465#true} {467#(<= 2 main_~len~0)} #81#return; {467#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:39,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {467#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {468#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:39,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {468#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {466#false} is VALID [2018-11-23 12:56:39,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {466#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {466#false} is VALID [2018-11-23 12:56:39,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {466#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {466#false} is VALID [2018-11-23 12:56:39,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-23 12:56:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:39,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:56:39,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:56:39,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:39,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:56:40,040 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:56:40,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:56:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:56:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:40,041 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-11-23 12:56:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:40,261 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:56:40,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:56:40,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:56:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 12:56:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 12:56:40,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-23 12:56:40,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:40,360 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:56:40,360 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:56:40,361 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:56:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:56:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:56:40,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:40,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:56:40,427 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:56:40,427 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:56:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:40,432 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:56:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:56:40,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:40,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:40,434 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:56:40,434 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:56:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:40,438 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:56:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:56:40,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:40,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:40,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:40,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:56:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:56:40,442 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2018-11-23 12:56:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:40,443 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:56:40,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:56:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:56:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:56:40,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:40,445 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] [2018-11-23 12:56:40,445 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:40,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1027668706, now seen corresponding path program 1 times [2018-11-23 12:56:40,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:40,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:40,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:40,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:40,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:40,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2018-11-23 12:56:40,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {663#true} is VALID [2018-11-23 12:56:40,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:40,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #89#return; {663#true} is VALID [2018-11-23 12:56:40,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret16 := main(); {663#true} is VALID [2018-11-23 12:56:40,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {663#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {665#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:40,742 INFO L256 TraceCheckUtils]: 6: Hoare triple {665#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {663#true} is VALID [2018-11-23 12:56:40,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {663#true} ~len := #in~len;~data := #in~data; {663#true} is VALID [2018-11-23 12:56:40,742 INFO L256 TraceCheckUtils]: 8: Hoare triple {663#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {663#true} is VALID [2018-11-23 12:56:40,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {663#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {663#true} is VALID [2018-11-23 12:56:40,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {663#true} is VALID [2018-11-23 12:56:40,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {663#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {663#true} is VALID [2018-11-23 12:56:40,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:40,744 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {663#true} {663#true} #85#return; {663#true} is VALID [2018-11-23 12:56:40,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {663#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {663#true} is VALID [2018-11-23 12:56:40,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {663#true} assume !!(~len > 1); {663#true} is VALID [2018-11-23 12:56:40,745 INFO L256 TraceCheckUtils]: 16: Hoare triple {663#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {663#true} is VALID [2018-11-23 12:56:40,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {663#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {663#true} is VALID [2018-11-23 12:56:40,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {663#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {663#true} is VALID [2018-11-23 12:56:40,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {663#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {663#true} is VALID [2018-11-23 12:56:40,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:40,746 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {663#true} {663#true} #87#return; {663#true} is VALID [2018-11-23 12:56:40,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {663#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {663#true} is VALID [2018-11-23 12:56:40,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {663#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {663#true} is VALID [2018-11-23 12:56:40,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {663#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {663#true} is VALID [2018-11-23 12:56:40,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {663#true} assume !(~len > 1); {663#true} is VALID [2018-11-23 12:56:40,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {663#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {663#true} is VALID [2018-11-23 12:56:40,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:40,752 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {663#true} {665#(<= 2 main_~len~0)} #81#return; {665#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:40,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {665#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:40,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0); {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:40,754 INFO L256 TraceCheckUtils]: 31: Hoare triple {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {663#true} is VALID [2018-11-23 12:56:40,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {663#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {663#true} is VALID [2018-11-23 12:56:40,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {663#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {663#true} is VALID [2018-11-23 12:56:40,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:40,760 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {663#true} {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} #83#return; {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:40,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {666#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {667#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:56:40,762 INFO L273 TraceCheckUtils]: 37: Hoare triple {667#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {664#false} is VALID [2018-11-23 12:56:40,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {664#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {664#false} is VALID [2018-11-23 12:56:40,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {664#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {664#false} is VALID [2018-11-23 12:56:40,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {664#false} assume !false; {664#false} is VALID [2018-11-23 12:56:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:40,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:40,768 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:56:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:40,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:41,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2018-11-23 12:56:41,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {663#true} is VALID [2018-11-23 12:56:41,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:41,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #89#return; {663#true} is VALID [2018-11-23 12:56:41,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret16 := main(); {663#true} is VALID [2018-11-23 12:56:41,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {663#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {665#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:41,397 INFO L256 TraceCheckUtils]: 6: Hoare triple {665#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {663#true} is VALID [2018-11-23 12:56:41,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {663#true} ~len := #in~len;~data := #in~data; {663#true} is VALID [2018-11-23 12:56:41,398 INFO L256 TraceCheckUtils]: 8: Hoare triple {663#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {663#true} is VALID [2018-11-23 12:56:41,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {663#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {663#true} is VALID [2018-11-23 12:56:41,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {663#true} is VALID [2018-11-23 12:56:41,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {663#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {663#true} is VALID [2018-11-23 12:56:41,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:41,401 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {663#true} {663#true} #85#return; {663#true} is VALID [2018-11-23 12:56:41,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {663#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {663#true} is VALID [2018-11-23 12:56:41,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {663#true} assume !!(~len > 1); {663#true} is VALID [2018-11-23 12:56:41,402 INFO L256 TraceCheckUtils]: 16: Hoare triple {663#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {663#true} is VALID [2018-11-23 12:56:41,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {663#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {663#true} is VALID [2018-11-23 12:56:41,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {663#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {663#true} is VALID [2018-11-23 12:56:41,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {663#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {663#true} is VALID [2018-11-23 12:56:41,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:41,404 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {663#true} {663#true} #87#return; {663#true} is VALID [2018-11-23 12:56:41,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {663#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {663#true} is VALID [2018-11-23 12:56:41,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {663#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {663#true} is VALID [2018-11-23 12:56:41,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {663#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {663#true} is VALID [2018-11-23 12:56:41,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {663#true} assume !(~len > 1); {663#true} is VALID [2018-11-23 12:56:41,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {663#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {663#true} is VALID [2018-11-23 12:56:41,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:41,413 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {663#true} {665#(<= 2 main_~len~0)} #81#return; {665#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:41,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {665#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:41,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0); {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:41,418 INFO L256 TraceCheckUtils]: 31: Hoare triple {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {663#true} is VALID [2018-11-23 12:56:41,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {663#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {663#true} is VALID [2018-11-23 12:56:41,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {663#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {663#true} is VALID [2018-11-23 12:56:41,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {663#true} assume true; {663#true} is VALID [2018-11-23 12:56:41,420 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {663#true} {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #83#return; {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:41,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {758#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {780#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:41,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {780#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {664#false} is VALID [2018-11-23 12:56:41,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {664#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {664#false} is VALID [2018-11-23 12:56:41,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {664#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {664#false} is VALID [2018-11-23 12:56:41,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {664#false} assume !false; {664#false} is VALID [2018-11-23 12:56:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:41,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:41,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 12:56:41,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 12:56:41,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:41,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:56:41,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:41,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:56:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:56:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:56:41,601 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-11-23 12:56:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:42,056 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 12:56:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:56:42,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 12:56:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:56:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 12:56:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:56:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 12:56:42,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-23 12:56:42,272 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:56:42,274 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:56:42,274 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:56:42,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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:56:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:56:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 12:56:42,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:42,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-23 12:56:42,336 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-23 12:56:42,336 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-23 12:56:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:42,342 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 12:56:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:56:42,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:42,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:42,343 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-23 12:56:42,344 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-23 12:56:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:42,351 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 12:56:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:56:42,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:42,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:42,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:42,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:56:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 12:56:42,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 41 [2018-11-23 12:56:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:42,361 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 12:56:42,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:56:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 12:56:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:56:42,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:42,364 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:56:42,364 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:42,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2134127076, now seen corresponding path program 2 times [2018-11-23 12:56:42,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:42,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:42,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {1002#true} call ULTIMATE.init(); {1002#true} is VALID [2018-11-23 12:56:42,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {1002#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1002#true} is VALID [2018-11-23 12:56:42,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-23 12:56:42,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1002#true} {1002#true} #89#return; {1002#true} is VALID [2018-11-23 12:56:42,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {1002#true} call #t~ret16 := main(); {1002#true} is VALID [2018-11-23 12:56:42,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {1002#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1002#true} is VALID [2018-11-23 12:56:42,722 INFO L256 TraceCheckUtils]: 6: Hoare triple {1002#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1002#true} is VALID [2018-11-23 12:56:42,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {1002#true} ~len := #in~len;~data := #in~data; {1002#true} is VALID [2018-11-23 12:56:42,722 INFO L256 TraceCheckUtils]: 8: Hoare triple {1002#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1002#true} is VALID [2018-11-23 12:56:42,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1002#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1002#true} is VALID [2018-11-23 12:56:42,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {1002#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1002#true} is VALID [2018-11-23 12:56:42,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {1002#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1002#true} is VALID [2018-11-23 12:56:42,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-23 12:56:42,724 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1002#true} {1002#true} #85#return; {1002#true} is VALID [2018-11-23 12:56:42,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {1002#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1002#true} is VALID [2018-11-23 12:56:42,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {1002#true} assume !!(~len > 1); {1002#true} is VALID [2018-11-23 12:56:42,724 INFO L256 TraceCheckUtils]: 16: Hoare triple {1002#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1002#true} is VALID [2018-11-23 12:56:42,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {1002#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1002#true} is VALID [2018-11-23 12:56:42,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {1002#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1002#true} is VALID [2018-11-23 12:56:42,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {1002#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1002#true} is VALID [2018-11-23 12:56:42,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-23 12:56:42,725 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1002#true} {1002#true} #87#return; {1002#true} is VALID [2018-11-23 12:56:42,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {1002#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {1002#true} is VALID [2018-11-23 12:56:42,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {1002#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {1002#true} is VALID [2018-11-23 12:56:42,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {1002#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1002#true} is VALID [2018-11-23 12:56:42,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {1002#true} assume !(~len > 1); {1002#true} is VALID [2018-11-23 12:56:42,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {1002#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1002#true} is VALID [2018-11-23 12:56:42,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-23 12:56:42,727 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1002#true} {1002#true} #81#return; {1002#true} is VALID [2018-11-23 12:56:42,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {1002#true} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {1002#true} is VALID [2018-11-23 12:56:42,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {1002#true} assume !!(~i~0 < ~len~0); {1002#true} is VALID [2018-11-23 12:56:42,728 INFO L256 TraceCheckUtils]: 31: Hoare triple {1002#true} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1002#true} is VALID [2018-11-23 12:56:42,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {1002#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1002#true} is VALID [2018-11-23 12:56:42,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {1002#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1002#true} is VALID [2018-11-23 12:56:42,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-23 12:56:42,729 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1002#true} {1002#true} #83#return; {1002#true} is VALID [2018-11-23 12:56:42,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {1002#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1002#true} is VALID [2018-11-23 12:56:42,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {1002#true} assume !!(~i~0 < ~len~0); {1002#true} is VALID [2018-11-23 12:56:42,730 INFO L256 TraceCheckUtils]: 38: Hoare triple {1002#true} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1002#true} is VALID [2018-11-23 12:56:42,732 INFO L273 TraceCheckUtils]: 39: Hoare triple {1002#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1004#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|))} is VALID [2018-11-23 12:56:42,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {1004#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1005#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:42,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {1005#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} assume true; {1005#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:42,742 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1005#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} {1002#true} #83#return; {1006#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:42,747 INFO L273 TraceCheckUtils]: 43: Hoare triple {1006#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1006#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:42,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {1006#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !(~i~0 < ~len~0); {1006#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:42,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {1006#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1007#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} is VALID [2018-11-23 12:56:42,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {1007#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1003#false} is VALID [2018-11-23 12:56:42,750 INFO L273 TraceCheckUtils]: 47: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2018-11-23 12:56:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:56:42,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:42,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:56:42,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-23 12:56:42,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:42,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:56:42,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:42,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:56:42,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:56:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:56:42,888 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 6 states. [2018-11-23 12:56:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:43,517 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-23 12:56:43,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:56:43,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-23 12:56:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:56:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2018-11-23 12:56:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:56:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2018-11-23 12:56:43,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2018-11-23 12:56:43,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:43,633 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:56:43,633 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:56:43,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:56:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:56:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-11-23 12:56:43,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:43,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 42 states. [2018-11-23 12:56:43,710 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 42 states. [2018-11-23 12:56:43,710 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 42 states. [2018-11-23 12:56:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:43,715 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:56:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:56:43,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:43,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:43,716 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 49 states. [2018-11-23 12:56:43,717 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 49 states. [2018-11-23 12:56:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:43,720 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:56:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:56:43,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:43,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:43,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:43,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:56:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 12:56:43,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 48 [2018-11-23 12:56:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:43,725 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 12:56:43,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:56:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:56:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:56:43,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:43,727 INFO L402 BasicCegarLoop]: trace histogram [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:56:43,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:43,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1324780450, now seen corresponding path program 1 times [2018-11-23 12:56:43,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:43,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:43,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:44,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {1248#true} call ULTIMATE.init(); {1248#true} is VALID [2018-11-23 12:56:44,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {1248#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1248#true} is VALID [2018-11-23 12:56:44,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:44,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1248#true} {1248#true} #89#return; {1248#true} is VALID [2018-11-23 12:56:44,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {1248#true} call #t~ret16 := main(); {1248#true} is VALID [2018-11-23 12:56:44,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {1248#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1250#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 12:56:44,496 INFO L256 TraceCheckUtils]: 6: Hoare triple {1250#(not (= 0 |main_~#s~0.base|))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1248#true} is VALID [2018-11-23 12:56:44,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {1248#true} ~len := #in~len;~data := #in~data; {1248#true} is VALID [2018-11-23 12:56:44,496 INFO L256 TraceCheckUtils]: 8: Hoare triple {1248#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1248#true} is VALID [2018-11-23 12:56:44,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {1248#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1248#true} is VALID [2018-11-23 12:56:44,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {1248#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1248#true} is VALID [2018-11-23 12:56:44,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {1248#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1248#true} is VALID [2018-11-23 12:56:44,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:44,498 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1248#true} {1248#true} #85#return; {1248#true} is VALID [2018-11-23 12:56:44,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {1248#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1248#true} is VALID [2018-11-23 12:56:44,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {1248#true} assume !!(~len > 1); {1248#true} is VALID [2018-11-23 12:56:44,498 INFO L256 TraceCheckUtils]: 16: Hoare triple {1248#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1248#true} is VALID [2018-11-23 12:56:44,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {1248#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1248#true} is VALID [2018-11-23 12:56:44,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {1248#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1248#true} is VALID [2018-11-23 12:56:44,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {1248#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1248#true} is VALID [2018-11-23 12:56:44,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:44,500 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1248#true} {1248#true} #87#return; {1248#true} is VALID [2018-11-23 12:56:44,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {1248#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {1248#true} is VALID [2018-11-23 12:56:44,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {1248#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {1248#true} is VALID [2018-11-23 12:56:44,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {1248#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1248#true} is VALID [2018-11-23 12:56:44,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {1248#true} assume !(~len > 1); {1248#true} is VALID [2018-11-23 12:56:44,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {1248#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1248#true} is VALID [2018-11-23 12:56:44,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:44,503 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1248#true} {1250#(not (= 0 |main_~#s~0.base|))} #81#return; {1250#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 12:56:44,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {1250#(not (= 0 |main_~#s~0.base|))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {1250#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 12:56:44,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {1250#(not (= 0 |main_~#s~0.base|))} assume !!(~i~0 < ~len~0); {1250#(not (= 0 |main_~#s~0.base|))} is VALID [2018-11-23 12:56:44,505 INFO L256 TraceCheckUtils]: 31: Hoare triple {1250#(not (= 0 |main_~#s~0.base|))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1248#true} is VALID [2018-11-23 12:56:44,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {1248#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1251#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|))} is VALID [2018-11-23 12:56:44,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {1251#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:44,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} assume true; {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:44,510 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} {1250#(not (= 0 |main_~#s~0.base|))} #83#return; {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:44,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:44,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !!(~i~0 < ~len~0); {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:44,515 INFO L256 TraceCheckUtils]: 38: Hoare triple {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1254#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:44,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {1254#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1255#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (or (= dll_circular_remove_last_~head.base (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:56:44,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {1255#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (or (= dll_circular_remove_last_~head.base (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, 4 + ~last~1.offset, 4);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, 4 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4);havoc #t~mem12.base, #t~mem12.offset; {1256#(or (and (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (= |dll_circular_remove_last_#in~head.base| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:44,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {1256#(or (and (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (= |dll_circular_remove_last_#in~head.base| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} assume true; {1256#(or (and (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (= |dll_circular_remove_last_#in~head.base| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:44,525 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1256#(or (and (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (= |dll_circular_remove_last_#in~head.base| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} {1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #83#return; {1257#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:44,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {1257#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1257#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:44,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {1257#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !(~i~0 < ~len~0); {1257#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:56:44,546 INFO L273 TraceCheckUtils]: 45: Hoare triple {1257#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1258#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} is VALID [2018-11-23 12:56:44,546 INFO L273 TraceCheckUtils]: 46: Hoare triple {1258#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1249#false} is VALID [2018-11-23 12:56:44,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {1249#false} assume !false; {1249#false} is VALID [2018-11-23 12:56:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:44,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:44,556 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:56:44,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:44,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:44,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:56:44,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:56:44,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:44,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:44,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:56:44,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:56:44,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:44,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:44,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:44,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-23 12:56:47,067 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int)) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse2 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (select |c_old(#memory_$Pointer$.offset)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.offset)))) (store .cse0 dll_circular_remove_last_~snd_to_last~0.base (store (select .cse0 dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select .cse0 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))))) (= (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.base)))) (store .cse3 dll_circular_remove_last_~snd_to_last~0.base (store (select .cse3 dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select .cse3 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)))) |c_#memory_$Pointer$.base|)))) is different from true [2018-11-23 12:56:47,237 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-11-23 12:56:47,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2018-11-23 12:56:47,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 12:56:47,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:47,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 116 [2018-11-23 12:56:47,553 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:56:47,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 113 [2018-11-23 12:56:47,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:47,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 [2018-11-23 12:56:47,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:48,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:48,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:48,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-11-23 12:56:48,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 12:56:48,232 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:48,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2018-11-23 12:56:48,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-11-23 12:56:48,437 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:48,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 12:56:48,586 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 12:56:48,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 63 [2018-11-23 12:56:48,721 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:48,790 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:56:48,813 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:56:48,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:56:48,865 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:184, output treesize:157 [2018-11-23 12:56:48,878 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:48,878 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|, dll_circular_remove_last_~snd_to_last~0.offset, dll_circular_remove_last_~snd_to_last~0.base]. (let ((.cse4 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse2 (+ .cse4 4))) (and (= .cse0 0) (= |main_~#s~0.offset| 0) (= (let ((.cse1 (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse0 (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse0) .cse2 dll_circular_remove_last_~snd_to_last~0.offset)))) (store .cse1 dll_circular_remove_last_~snd_to_last~0.base (store (select .cse1 dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select .cse1 |main_~#s~0.base|) |main_~#s~0.offset|)))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (let ((.cse3 (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse0 (store (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse0) .cse2 dll_circular_remove_last_~snd_to_last~0.base)))) (store .cse3 dll_circular_remove_last_~snd_to_last~0.base (store (select .cse3 dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select .cse3 |main_~#s~0.base|) |main_~#s~0.offset|))))) (not (= |main_~#s~0.base| 0)) (= .cse4 0)))) [2018-11-23 12:56:48,879 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse8 (+ .cse1 4))) (let ((.cse0 (= .cse1 0)) (.cse3 (select (select |#memory_$Pointer$.offset| .cse4) .cse8)) (.cse5 (= .cse4 0)) (.cse6 (= |main_~#s~0.offset| 0)) (.cse7 (not (= |main_~#s~0.base| 0)))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| 0) .cse8))) (and .cse0 (= .cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (= .cse4 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) .cse5 .cse6 .cse7)) (and .cse0 (= .cse3 .cse1) (= .cse4 (select (select |#memory_$Pointer$.base| .cse4) .cse8)) .cse5 .cse6 .cse7))))) [2018-11-23 12:56:49,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-11-23 12:56:49,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2018-11-23 12:56:49,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 21 [2018-11-23 12:56:49,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 12:56:49,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-11-23 12:56:49,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 12:56:49,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2018-11-23 12:56:49,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 83 [2018-11-23 12:56:49,454 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:56:49,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-11-23 12:56:49,560 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2018-11-23 12:56:49,656 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:49,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 78 [2018-11-23 12:56:49,749 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:56:49,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2018-11-23 12:56:49,837 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:49,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2018-11-23 12:56:49,931 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:50,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:50,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 86 [2018-11-23 12:56:50,027 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:56:50,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-11-23 12:56:50,110 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:56:50,193 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-23 12:56:50,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 65 [2018-11-23 12:56:50,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2018-11-23 12:56:50,331 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:50,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:50,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 12:56:50,419 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,481 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2018-11-23 12:56:50,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2018-11-23 12:56:50,528 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2018-11-23 12:56:50,580 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,618 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 61 [2018-11-23 12:56:50,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2018-11-23 12:56:50,692 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-11-23 12:56:50,740 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-11-23 12:56:50,778 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:50,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 12:56:50,827 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,850 INFO L267 ElimStorePlain]: Start of recursive call 23: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-23 12:56:50,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 12:56:50,871 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 12:56:50,888 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,907 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:50,932 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 6 variables, input treesize:179, output treesize:7 [2018-11-23 12:56:50,937 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:50,938 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|, v_prenex_6, v_prenex_5, v_prenex_4]. (or (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (.cse2 (+ .cse1 4))) (and (= |main_#t~mem15.base| .cse0) (= .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= .cse0 0) (= |main_#t~mem15.offset| .cse1) (= .cse1 0) (= .cse0 (select (select |#memory_$Pointer$.base| .cse0) .cse2)) (not (= |main_~#s~0.base| 0))))) (let ((.cse3 (select (select v_prenex_6 v_prenex_5) 0))) (let ((.cse4 (select (select v_prenex_4 v_prenex_5) 0)) (.cse7 (+ .cse3 4))) (let ((.cse5 (select (select v_prenex_4 0) .cse7)) (.cse6 (select (select v_prenex_6 .cse4) .cse7))) (and (= .cse3 0) (= |main_#t~mem15.offset| .cse3) (= .cse4 0) (= (select (select v_prenex_6 .cse5) .cse6) .cse3) (not (= v_prenex_5 0)) (= .cse4 (select (select v_prenex_4 .cse5) .cse6)) (= |main_#t~mem15.base| .cse4)))))) [2018-11-23 12:56:50,938 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem15.base| 0) (= |main_#t~mem15.offset| 0)) [2018-11-23 12:56:50,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {1248#true} call ULTIMATE.init(); {1248#true} is VALID [2018-11-23 12:56:50,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {1248#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1248#true} is VALID [2018-11-23 12:56:50,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:50,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1248#true} {1248#true} #89#return; {1248#true} is VALID [2018-11-23 12:56:50,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {1248#true} call #t~ret16 := main(); {1248#true} is VALID [2018-11-23 12:56:50,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {1248#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:50,951 INFO L256 TraceCheckUtils]: 6: Hoare triple {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1248#true} is VALID [2018-11-23 12:56:50,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {1248#true} ~len := #in~len;~data := #in~data; {1248#true} is VALID [2018-11-23 12:56:50,952 INFO L256 TraceCheckUtils]: 8: Hoare triple {1248#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1248#true} is VALID [2018-11-23 12:56:50,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {1248#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1248#true} is VALID [2018-11-23 12:56:50,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {1248#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1248#true} is VALID [2018-11-23 12:56:50,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {1248#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1248#true} is VALID [2018-11-23 12:56:50,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:50,953 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1248#true} {1248#true} #85#return; {1248#true} is VALID [2018-11-23 12:56:50,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {1248#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1248#true} is VALID [2018-11-23 12:56:50,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {1248#true} assume !!(~len > 1); {1248#true} is VALID [2018-11-23 12:56:50,954 INFO L256 TraceCheckUtils]: 16: Hoare triple {1248#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1248#true} is VALID [2018-11-23 12:56:50,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {1248#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1248#true} is VALID [2018-11-23 12:56:50,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {1248#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1248#true} is VALID [2018-11-23 12:56:50,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {1248#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1248#true} is VALID [2018-11-23 12:56:50,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:50,956 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1248#true} {1248#true} #87#return; {1248#true} is VALID [2018-11-23 12:56:50,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {1248#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {1248#true} is VALID [2018-11-23 12:56:50,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {1248#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {1248#true} is VALID [2018-11-23 12:56:50,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {1248#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1248#true} is VALID [2018-11-23 12:56:50,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {1248#true} assume !(~len > 1); {1248#true} is VALID [2018-11-23 12:56:50,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {1248#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1248#true} is VALID [2018-11-23 12:56:50,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:56:50,977 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1248#true} {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} #81#return; {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:50,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0; {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:50,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} assume !!(~i~0 < ~len~0); {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:50,994 INFO L256 TraceCheckUtils]: 31: Hoare triple {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1248#true} is VALID [2018-11-23 12:56:50,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {1248#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1251#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|))} is VALID [2018-11-23 12:56:50,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {1251#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:50,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} assume true; {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} is VALID [2018-11-23 12:56:50,999 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1252#(and (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))} {1277#(and (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} #83#return; {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:51,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:51,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} assume !!(~i~0 < ~len~0); {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} is VALID [2018-11-23 12:56:51,002 INFO L256 TraceCheckUtils]: 38: Hoare triple {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1254#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:51,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {1254#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, 4 + #t~mem6.offset, 4);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1381#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= |dll_circular_remove_last_#in~head.offset| dll_circular_remove_last_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:51,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {1381#(and (= dll_circular_remove_last_~head.base |dll_circular_remove_last_#in~head.base|) (= |dll_circular_remove_last_#in~head.offset| dll_circular_remove_last_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, 4 + ~last~1.offset, 4);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, 4 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4);havoc #t~mem12.base, #t~mem12.offset; {1385#(exists ((dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) |#memory_$Pointer$.base|)))} is VALID [2018-11-23 12:56:51,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {1385#(exists ((dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) |#memory_$Pointer$.base|)))} assume true; {1385#(exists ((dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) |#memory_$Pointer$.base|)))} is VALID [2018-11-23 12:56:51,024 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1385#(exists ((dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.offset)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) 4) dll_circular_remove_last_~snd_to_last~0.base)) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) |#memory_$Pointer$.base|)))} {1368#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0)))} #83#return; {1392#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))))} is VALID [2018-11-23 12:56:51,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {1392#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1392#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))))} is VALID [2018-11-23 12:56:51,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {1392#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))))} assume !(~i~0 < ~len~0); {1392#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))))} is VALID [2018-11-23 12:56:51,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {1392#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 0) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| 0))))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1258#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} is VALID [2018-11-23 12:56:51,029 INFO L273 TraceCheckUtils]: 46: Hoare triple {1258#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1249#false} is VALID [2018-11-23 12:56:51,029 INFO L273 TraceCheckUtils]: 47: Hoare triple {1249#false} assume !false; {1249#false} is VALID [2018-11-23 12:56:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-23 12:56:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-11-23 12:56:51,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-11-23 12:56:51,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:51,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:56:51,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:51,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:56:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:56:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2018-11-23 12:56:51,164 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 16 states. [2018-11-23 12:57:54,811 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-11-23 12:58:44,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:44,428 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-23 12:58:44,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:58:44,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-11-23 12:58:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:58:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2018-11-23 12:58:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:58:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2018-11-23 12:58:44,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2018-11-23 12:58:44,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:44,541 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:58:44,542 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:58:44,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=4, NotChecked=38, Total=462 [2018-11-23 12:58:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:58:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:58:44,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:44,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:58:44,583 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:58:44,583 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:58:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:44,586 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:58:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:58:44,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:44,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:44,587 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:58:44,587 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:58:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:44,589 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:58:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:58:44,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:44,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:44,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:44,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:58:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 12:58:44,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 48 [2018-11-23 12:58:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:44,592 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 12:58:44,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:58:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:58:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:58:44,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:44,593 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:58:44,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:44,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash 44916772, now seen corresponding path program 1 times [2018-11-23 12:58:44,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:44,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:44,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:47,075 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:47,080 INFO L168 Benchmark]: Toolchain (without parser) took 131843.57 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:47,081 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:47,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.71 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:47,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:47,083 INFO L168 Benchmark]: Boogie Preprocessor took 41.31 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:47,083 INFO L168 Benchmark]: RCFGBuilder took 1108.59 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:47,084 INFO L168 Benchmark]: TraceAbstraction took 129883.52 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 307.2 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -339.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:47,087 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 692.71 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.31 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 1108.59 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129883.52 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 307.2 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -339.3 MB). There was no memory consumed. 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...