./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95b20088216028e3d05e3cb41d4ed5c20af6a751 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:59:54,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:59:54,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:59:54,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:59:54,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:59:54,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:59:54,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:59:54,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:59:54,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:59:54,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:59:54,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:59:54,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:59:54,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:59:54,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:59:54,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:59:54,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:59:54,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:59:54,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:59:54,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:59:54,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:59:54,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:59:54,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:59:54,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:59:54,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:59:54,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:59:54,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:59:54,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:59:54,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:59:54,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:59:54,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:59:54,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:59:54,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:59:54,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:59:54,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:59:54,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:59:54,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:59:54,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:59:54,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:59:54,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:59:54,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:59:54,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:59:54,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:59:54,363 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:59:54,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:59:54,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:59:54,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:59:54,367 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:59:54,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:59:54,368 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:59:54,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:59:54,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:59:54,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:59:54,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:59:54,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:59:54,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:59:54,371 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:59:54,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:59:54,372 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:59:54,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:59:54,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:59:54,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:59:54,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:59:54,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:59:54,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:59:54,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:59:54,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:59:54,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:59:54,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:59:54,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:59:54,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:59:54,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:59:54,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95b20088216028e3d05e3cb41d4ed5c20af6a751 [2020-07-28 17:59:54,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:59:54,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:59:54,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:59:54,717 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:59:54,718 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:59:54,718 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2020-07-28 17:59:54,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7351de62a/9158f8c8dc3c4db6959248859328c90f/FLAG8f4015f90 [2020-07-28 17:59:55,236 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:59:55,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2020-07-28 17:59:55,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7351de62a/9158f8c8dc3c4db6959248859328c90f/FLAG8f4015f90 [2020-07-28 17:59:55,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7351de62a/9158f8c8dc3c4db6959248859328c90f [2020-07-28 17:59:55,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:59:55,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:59:55,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:59:55,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:59:55,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:59:55,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1207216f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55, skipping insertion in model container [2020-07-28 17:59:55,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:59:55,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:59:56,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:59:56,099 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:59:56,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:59:56,202 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:59:56,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56 WrapperNode [2020-07-28 17:59:56,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:59:56,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:59:56,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:59:56,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:59:56,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:59:56,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:59:56,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:59:56,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:59:56,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (1/1) ... [2020-07-28 17:59:56,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:59:56,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:59:56,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:59:56,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:59:56,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (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 [2020-07-28 17:59:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:59:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:59:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 17:59:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 17:59:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 17:59:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:59:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:59:56,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:59:56,873 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:59:56,873 INFO L295 CfgBuilder]: Removed 13 assume(true) statements. [2020-07-28 17:59:56,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:59:56 BoogieIcfgContainer [2020-07-28 17:59:56,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:59:56,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:59:56,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:59:56,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:59:56,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:59:55" (1/3) ... [2020-07-28 17:59:56,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27507131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:59:56, skipping insertion in model container [2020-07-28 17:59:56,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:56" (2/3) ... [2020-07-28 17:59:56,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27507131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:59:56, skipping insertion in model container [2020-07-28 17:59:56,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:59:56" (3/3) ... [2020-07-28 17:59:56,886 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2020-07-28 17:59:56,896 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:59:56,904 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-28 17:59:56,918 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 17:59:56,944 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:59:56,944 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:59:56,945 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:59:56,945 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:59:56,945 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:59:56,945 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:59:56,945 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:59:56,946 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:59:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-28 17:59:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 17:59:56,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:56,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 17:59:56,968 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2020-07-28 17:59:56,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:56,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647044284] [2020-07-28 17:59:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:57,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-28 17:59:57,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet5, main_#t~nondet1, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9, main_#t~mem11, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem12, main_#t~short13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem7, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem16, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~state~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(main_~head~0.base, main_~head~0.offset, main_~head~0.base, main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset;main_~state~0 := 1; {36#true} is VALID [2020-07-28 17:59:57,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2020-07-28 17:59:57,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {37#false} call write~int(main_~state~0, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~head~0.base, main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset; {37#false} is VALID [2020-07-28 17:59:57,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#false} assume !(0 != main_~x~0.base || 0 != main_~x~0.offset); {37#false} is VALID [2020-07-28 17:59:57,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-28 17:59:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:57,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647044284] [2020-07-28 17:59:57,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:57,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:59:57,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674622513] [2020-07-28 17:59:57,150 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 17:59:57,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:57,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:59:57,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:57,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:59:57,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:59:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:59:57,184 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-07-28 17:59:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,262 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2020-07-28 17:59:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:59:57,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 17:59:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:59:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2020-07-28 17:59:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:59:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2020-07-28 17:59:57,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2020-07-28 17:59:57,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:57,438 INFO L225 Difference]: With dead ends: 64 [2020-07-28 17:59:57,438 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:59:57,442 INFO L675 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 [2020-07-28 17:59:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:59:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:59:57,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:57,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:59:57,473 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:59:57,474 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:59:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,477 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2020-07-28 17:59:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 17:59:57,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:57,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:57,478 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:59:57,479 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:59:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,481 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2020-07-28 17:59:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 17:59:57,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:57,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:57,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:57,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:59:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-28 17:59:57,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2020-07-28 17:59:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:57,493 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-28 17:59:57,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:59:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 17:59:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 17:59:57,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:57,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:57,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:59:57,495 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2020-07-28 17:59:57,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:57,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786147858] [2020-07-28 17:59:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:57,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {198#true} is VALID [2020-07-28 17:59:57,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet5, main_#t~nondet1, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9, main_#t~mem11, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem12, main_#t~short13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem7, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem16, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~state~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(main_~head~0.base, main_~head~0.offset, main_~head~0.base, main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset;main_~state~0 := 1; {200#(and (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~head~0.offset) 0)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~x~0.offset 8))))} is VALID [2020-07-28 17:59:57,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#(and (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~head~0.offset) 0)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~x~0.offset 8))))} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {200#(and (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~head~0.offset) 0)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~x~0.offset 8))))} is VALID [2020-07-28 17:59:57,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {200#(and (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~head~0.offset) 0)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~x~0.offset 8))))} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; {200#(and (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~head~0.offset) 0)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~x~0.offset 8))))} is VALID [2020-07-28 17:59:57,662 INFO L280 TraceCheckUtils]: 4: Hoare triple {200#(and (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~head~0.offset) 0)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~x~0.offset 8))))} call write~int(main_~state~0, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~head~0.base, main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset; {201#(not (= 0 ULTIMATE.start_main_~x~0.base))} is VALID [2020-07-28 17:59:57,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {201#(not (= 0 ULTIMATE.start_main_~x~0.base))} assume !(0 != main_~x~0.base || 0 != main_~x~0.offset); {199#false} is VALID [2020-07-28 17:59:57,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {199#false} assume !false; {199#false} is VALID [2020-07-28 17:59:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:57,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786147858] [2020-07-28 17:59:57,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:57,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:59:57,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242330925] [2020-07-28 17:59:57,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 17:59:57,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:57,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:59:57,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:57,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:59:57,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:59:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:59:57,686 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2020-07-28 17:59:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,883 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-28 17:59:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:59:57,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 17:59:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:59:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2020-07-28 17:59:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:59:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2020-07-28 17:59:57,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2020-07-28 17:59:57,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:57,958 INFO L225 Difference]: With dead ends: 42 [2020-07-28 17:59:57,958 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 17:59:57,959 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:59:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 17:59:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-07-28 17:59:57,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:57,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 28 states. [2020-07-28 17:59:57,974 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 28 states. [2020-07-28 17:59:57,974 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 28 states. [2020-07-28 17:59:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,977 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-28 17:59:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-28 17:59:57,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:57,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:57,978 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 38 states. [2020-07-28 17:59:57,979 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 38 states. [2020-07-28 17:59:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,982 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-28 17:59:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-28 17:59:57,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:57,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:57,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:57,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:59:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-28 17:59:57,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2020-07-28 17:59:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:57,986 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-28 17:59:57,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:59:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-28 17:59:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:59:57,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:57,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:57,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:59:57,988 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2020-07-28 17:59:57,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:57,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845156073] [2020-07-28 17:59:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:58,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {365#true} is VALID [2020-07-28 17:59:58,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {365#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~nondet5, main_#t~nondet1, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9, main_#t~mem11, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem12, main_#t~short13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem7, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem16, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~state~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(main_~head~0.base, main_~head~0.offset, main_~head~0.base, main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset;main_~state~0 := 1; {367#(= 1 ULTIMATE.start_main_~state~0)} is VALID [2020-07-28 17:59:58,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#(= 1 ULTIMATE.start_main_~state~0)} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {367#(= 1 ULTIMATE.start_main_~state~0)} is VALID [2020-07-28 17:59:58,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {367#(= 1 ULTIMATE.start_main_~state~0)} assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_~x~0.base, main_~x~0.offset, main_#t~mem3.base, 4 + main_#t~mem3.offset, 4);havoc main_#t~mem3.base, main_#t~mem3.offset;call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;call write~$Pointer$(main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, 4);assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {367#(= 1 ULTIMATE.start_main_~state~0)} is VALID [2020-07-28 17:59:58,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= 1 ULTIMATE.start_main_~state~0)} assume 0 != main_#t~nondet5;havoc main_#t~nondet5; {367#(= 1 ULTIMATE.start_main_~state~0)} is VALID [2020-07-28 17:59:58,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#(= 1 ULTIMATE.start_main_~state~0)} assume !(1 == main_~state~0); {366#false} is VALID [2020-07-28 17:59:58,054 INFO L280 TraceCheckUtils]: 6: Hoare triple {366#false} assume !(2 == main_~state~0); {366#false} is VALID [2020-07-28 17:59:58,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {366#false} call write~int(main_~state~0, main_~x~0.base, 8 + main_~x~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~head~0.base, main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset; {366#false} is VALID [2020-07-28 17:59:58,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {366#false} assume !(0 != main_~x~0.base || 0 != main_~x~0.offset); {366#false} is VALID [2020-07-28 17:59:58,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {366#false} assume !false; {366#false} is VALID [2020-07-28 17:59:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:58,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845156073] [2020-07-28 17:59:58,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:58,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:59:58,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233975079] [2020-07-28 17:59:58,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 17:59:58,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:58,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:59:58,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:58,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:59:58,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:59:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:59:58,075 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2020-07-28 17:59:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,174 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2020-07-28 17:59:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:59:58,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 17:59:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:59:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-28 17:59:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:59:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-28 17:59:58,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-28 17:59:58,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:58,287 INFO L225 Difference]: With dead ends: 71 [2020-07-28 17:59:58,288 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 17:59:58,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:59:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 17:59:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2020-07-28 17:59:58,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:58,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 35 states. [2020-07-28 17:59:58,306 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 35 states. [2020-07-28 17:59:58,306 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 35 states. [2020-07-28 17:59:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,310 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-28 17:59:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-28 17:59:58,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:58,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:58,311 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 49 states. [2020-07-28 17:59:58,312 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 49 states. [2020-07-28 17:59:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,315 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-28 17:59:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-28 17:59:58,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:58,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:58,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:58,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 17:59:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-07-28 17:59:58,319 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2020-07-28 17:59:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:58,319 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-07-28 17:59:58,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:59:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-07-28 17:59:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:59:58,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:58,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:58,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:59:58,321 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2020-07-28 17:59:58,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:58,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707813034] [2020-07-28 17:59:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:59:58,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:59:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:59:58,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:59:58,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:59:58,416 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:59:58,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:59:58,452 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:59:58,452 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:59:58,453 WARN L170 areAnnotationChecker]: L1014-5 has no Hoare annotation [2020-07-28 17:59:58,453 WARN L170 areAnnotationChecker]: L1014-5 has no Hoare annotation [2020-07-28 17:59:58,453 WARN L170 areAnnotationChecker]: L994-3 has no Hoare annotation [2020-07-28 17:59:58,453 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-28 17:59:58,453 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-28 17:59:58,454 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-28 17:59:58,454 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-28 17:59:58,454 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-28 17:59:58,454 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-28 17:59:58,454 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-28 17:59:58,454 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 17:59:58,455 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 17:59:58,455 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-28 17:59:58,455 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-28 17:59:58,455 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-28 17:59:58,455 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-28 17:59:58,455 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-28 17:59:58,456 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-28 17:59:58,456 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-28 17:59:58,456 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-28 17:59:58,456 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-28 17:59:58,456 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-28 17:59:58,456 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-28 17:59:58,457 WARN L170 areAnnotationChecker]: L1023-7 has no Hoare annotation [2020-07-28 17:59:58,458 WARN L170 areAnnotationChecker]: L1023-7 has no Hoare annotation [2020-07-28 17:59:58,458 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2020-07-28 17:59:58,458 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2020-07-28 17:59:58,458 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-28 17:59:58,458 WARN L170 areAnnotationChecker]: L1014-3 has no Hoare annotation [2020-07-28 17:59:58,458 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-28 17:59:58,459 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-28 17:59:58,459 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-28 17:59:58,459 WARN L170 areAnnotationChecker]: L1023-1 has no Hoare annotation [2020-07-28 17:59:58,459 WARN L170 areAnnotationChecker]: L1023-1 has no Hoare annotation [2020-07-28 17:59:58,459 WARN L170 areAnnotationChecker]: L1023-8 has no Hoare annotation [2020-07-28 17:59:58,459 WARN L170 areAnnotationChecker]: L1037 has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: L1023-4 has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: L1023-4 has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: L1023-6 has no Hoare annotation [2020-07-28 17:59:58,460 WARN L170 areAnnotationChecker]: L1023-6 has no Hoare annotation [2020-07-28 17:59:58,461 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:59:58,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:59:58 BoogieIcfgContainer [2020-07-28 17:59:58,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:59:58,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:59:58,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:59:58,464 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:59:58,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:59:56" (3/4) ... [2020-07-28 17:59:58,467 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:59:58,523 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:59:58,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:59:58,526 INFO L168 Benchmark]: Toolchain (without parser) took 2997.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.2 MB in the beginning and 911.2 MB in the end (delta: 40.9 MB). Peak memory consumption was 176.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:58,527 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:59:58,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:58,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:58,529 INFO L168 Benchmark]: Boogie Preprocessor took 33.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:59:58,530 INFO L168 Benchmark]: RCFGBuilder took 584.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:58,530 INFO L168 Benchmark]: TraceAbstraction took 1585.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.2 MB in the end (delta: 161.0 MB). Peak memory consumption was 161.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:58,531 INFO L168 Benchmark]: Witness Printer took 59.45 ms. Allocated memory is still 1.2 GB. Free memory is still 911.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:59:58,536 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 672.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 584.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1585.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.2 MB in the end (delta: 161.0 MB). Peak memory consumption was 161.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.45 ms. Allocated memory is still 1.2 GB. Free memory is still 911.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = head [L988] head->data = 0 [L990] SLL* x = head; [L991] int state = 1; [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state [L1018] EXPR head->next [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) [L1021] EXPR x->data [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] EXPR x->data [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 85 SDtfs, 44 SDslu, 49 SDs, 0 SdLazy, 35 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...