./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5liff.c --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/array-fpi/s5liff.c -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 7e4ce42e4021b21ab14c0429f425871112089620 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:56:23,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:56:23,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:56:23,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:56:23,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:56:23,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:56:23,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:56:23,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:56:23,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:56:23,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:56:23,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:56:23,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:56:23,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:56:23,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:56:23,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:56:23,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:56:23,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:56:23,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:56:23,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:56:23,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:56:23,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:56:23,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:56:23,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:56:23,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:56:23,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:56:23,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:56:23,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:56:23,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:56:23,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:56:23,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:56:23,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:56:23,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:56:23,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:56:23,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:56:23,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:56:23,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:56:23,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:56:23,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:56:23,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:56:23,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:56:23,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:56:23,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:56:23,991 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:56:23,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:56:23,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:56:23,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:56:23,994 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:56:23,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:56:23,995 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:56:23,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:56:23,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:56:23,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:56:23,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:56:23,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:56:23,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:56:23,998 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:56:23,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:56:23,998 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:56:23,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:56:23,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:56:23,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:56:24,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:56:24,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:56:24,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:56:24,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:56:24,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:56:24,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:56:24,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:56:24,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:56:24,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:56:24,002 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:56:24,003 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 -> 7e4ce42e4021b21ab14c0429f425871112089620 [2020-07-28 14:56:24,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:56:24,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:56:24,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:56:24,402 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:56:24,403 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:56:24,405 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5liff.c [2020-07-28 14:56:24,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9052b07/e974013051d14177b4455dc56a308fe6/FLAGaf4dea55b [2020-07-28 14:56:24,855 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:56:24,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5liff.c [2020-07-28 14:56:24,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9052b07/e974013051d14177b4455dc56a308fe6/FLAGaf4dea55b [2020-07-28 14:56:25,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9052b07/e974013051d14177b4455dc56a308fe6 [2020-07-28 14:56:25,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:56:25,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:56:25,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:56:25,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:56:25,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:56:25,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c04553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25, skipping insertion in model container [2020-07-28 14:56:25,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:56:25,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:56:25,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:56:25,614 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:56:25,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:56:25,678 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:56:25,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25 WrapperNode [2020-07-28 14:56:25,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:56:25,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:56:25,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:56:25,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:56:25,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:56:25,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:56:25,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:56:25,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:56:25,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (1/1) ... [2020-07-28 14:56:25,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:56:25,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:56:25,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:56:25,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:56:25,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (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 14:56:25,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:56:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:56:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:56:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:56:25,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:56:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:56:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:56:26,323 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:56:26,323 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:56:26,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:56:26 BoogieIcfgContainer [2020-07-28 14:56:26,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:56:26,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:56:26,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:56:26,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:56:26,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:56:25" (1/3) ... [2020-07-28 14:56:26,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0c4a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:56:26, skipping insertion in model container [2020-07-28 14:56:26,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:56:25" (2/3) ... [2020-07-28 14:56:26,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0c4a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:56:26, skipping insertion in model container [2020-07-28 14:56:26,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:56:26" (3/3) ... [2020-07-28 14:56:26,335 INFO L109 eAbstractionObserver]: Analyzing ICFG s5liff.c [2020-07-28 14:56:26,345 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:56:26,353 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:56:26,363 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:56:26,380 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:56:26,380 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:56:26,380 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:56:26,380 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:56:26,381 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:56:26,381 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:56:26,381 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:56:26,381 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:56:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-28 14:56:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:56:26,400 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:56:26,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:56:26,401 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:56:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:56:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2020-07-28 14:56:26,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:56:26,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509144072] [2020-07-28 14:56:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:56:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:56:26,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {25#true} is VALID [2020-07-28 14:56:26,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~post3, main_#t~mem8, main_#t~mem9, main_#t~post7, main_#t~mem10, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {25#true} is VALID [2020-07-28 14:56:26,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {25#true} is VALID [2020-07-28 14:56:26,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#true} assume 0 == assume_abort_if_not_~cond;assume false; {26#false} is VALID [2020-07-28 14:56:26,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(~N~0, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {26#false} is VALID [2020-07-28 14:56:26,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#false} assume !(main_~i~0 < ~N~0); {26#false} is VALID [2020-07-28 14:56:26,548 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#false} main_~i~0 := 0; {26#false} is VALID [2020-07-28 14:56:26,548 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#false} assume !(main_~i~0 < ~N~0); {26#false} is VALID [2020-07-28 14:56:26,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {26#false} main_~i~0 := 0; {26#false} is VALID [2020-07-28 14:56:26,549 INFO L280 TraceCheckUtils]: 9: Hoare triple {26#false} assume !(main_~i~0 < ~N~0); {26#false} is VALID [2020-07-28 14:56:26,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {26#false} call main_#t~mem10 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem10 == 6 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {26#false} is VALID [2020-07-28 14:56:26,551 INFO L280 TraceCheckUtils]: 11: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond; {26#false} is VALID [2020-07-28 14:56:26,552 INFO L280 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-28 14:56:26,554 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 14:56:26,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509144072] [2020-07-28 14:56:26,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:56:26,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:56:26,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920270361] [2020-07-28 14:56:26,562 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 14:56:26,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:56:26,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:56:26,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:56:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:56:26,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:56:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:56:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:56:26,631 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2020-07-28 14:56:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:56:26,694 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-07-28 14:56:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:56:26,694 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 14:56:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:56:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:56:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2020-07-28 14:56:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:56:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2020-07-28 14:56:26,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2020-07-28 14:56:26,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:56:26,851 INFO L225 Difference]: With dead ends: 40 [2020-07-28 14:56:26,853 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 14:56:26,858 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 14:56:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 14:56:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 14:56:26,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:56:26,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 14:56:26,885 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 14:56:26,885 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 14:56:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:56:26,888 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 14:56:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-28 14:56:26,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:56:26,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:56:26,889 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 14:56:26,889 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 14:56:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:56:26,891 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 14:56:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-28 14:56:26,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:56:26,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:56:26,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:56:26,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:56:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 14:56:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-07-28 14:56:26,896 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2020-07-28 14:56:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:56:26,896 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-28 14:56:26,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:56:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-28 14:56:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:56:26,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:56:26,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:56:26,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:56:26,898 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:56:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:56:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2020-07-28 14:56:26,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:56:26,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248180538] [2020-07-28 14:56:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:56:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:56:26,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {134#true} is VALID [2020-07-28 14:56:26,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~post3, main_#t~mem8, main_#t~mem9, main_#t~post7, main_#t~mem10, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {134#true} is VALID [2020-07-28 14:56:26,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {134#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {136#(<= 1 ~N~0)} is VALID [2020-07-28 14:56:27,000 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {136#(<= 1 ~N~0)} is VALID [2020-07-28 14:56:27,001 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(~N~0, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {137#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:56:27,002 INFO L280 TraceCheckUtils]: 5: Hoare triple {137#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {135#false} is VALID [2020-07-28 14:56:27,002 INFO L280 TraceCheckUtils]: 6: Hoare triple {135#false} main_~i~0 := 0; {135#false} is VALID [2020-07-28 14:56:27,003 INFO L280 TraceCheckUtils]: 7: Hoare triple {135#false} assume !(main_~i~0 < ~N~0); {135#false} is VALID [2020-07-28 14:56:27,003 INFO L280 TraceCheckUtils]: 8: Hoare triple {135#false} main_~i~0 := 0; {135#false} is VALID [2020-07-28 14:56:27,003 INFO L280 TraceCheckUtils]: 9: Hoare triple {135#false} assume !(main_~i~0 < ~N~0); {135#false} is VALID [2020-07-28 14:56:27,004 INFO L280 TraceCheckUtils]: 10: Hoare triple {135#false} call main_#t~mem10 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem10 == 6 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {135#false} is VALID [2020-07-28 14:56:27,004 INFO L280 TraceCheckUtils]: 11: Hoare triple {135#false} assume 0 == __VERIFIER_assert_~cond; {135#false} is VALID [2020-07-28 14:56:27,004 INFO L280 TraceCheckUtils]: 12: Hoare triple {135#false} assume !false; {135#false} is VALID [2020-07-28 14:56:27,005 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 14:56:27,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248180538] [2020-07-28 14:56:27,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:56:27,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:56:27,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412788249] [2020-07-28 14:56:27,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-28 14:56:27,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:56:27,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:56:27,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:56:27,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:56:27,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:56:27,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:56:27,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:56:27,034 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 4 states. [2020-07-28 14:56:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:56:27,171 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-28 14:56:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:56:27,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-28 14:56:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:56:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:56:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-28 14:56:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:56:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-28 14:56:27,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2020-07-28 14:56:27,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:56:27,244 INFO L225 Difference]: With dead ends: 36 [2020-07-28 14:56:27,244 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 14:56:27,245 INFO L675 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 [2020-07-28 14:56:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 14:56:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2020-07-28 14:56:27,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:56:27,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 21 states. [2020-07-28 14:56:27,259 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 21 states. [2020-07-28 14:56:27,259 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 21 states. [2020-07-28 14:56:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:56:27,261 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:56:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:56:27,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:56:27,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:56:27,262 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 25 states. [2020-07-28 14:56:27,263 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 25 states. [2020-07-28 14:56:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:56:27,265 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:56:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:56:27,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:56:27,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:56:27,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:56:27,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:56:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 14:56:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-28 14:56:27,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2020-07-28 14:56:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:56:27,269 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-28 14:56:27,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:56:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 14:56:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:56:27,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:56:27,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:56:27,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:56:27,272 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:56:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:56:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2020-07-28 14:56:27,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:56:27,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430366000] [2020-07-28 14:56:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:56:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:56:27,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:56:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:56:27,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:56:27,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:56:27,425 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:56:27,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 14:56:27,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:56:27,476 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:56:27,477 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:56:27,478 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:56:27,479 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 14:56:27,480 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-28 14:56:27,480 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-28 14:56:27,480 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:56:27,480 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:56:27,480 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:56:27,480 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:56:27,481 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:56:27,481 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 14:56:27,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:56:27 BoogieIcfgContainer [2020-07-28 14:56:27,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:56:27,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:56:27,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:56:27,484 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:56:27,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:56:26" (3/4) ... [2020-07-28 14:56:27,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:56:27,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:56:27,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:56:27,560 INFO L168 Benchmark]: Toolchain (without parser) took 2254.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 962.9 MB in the beginning and 937.0 MB in the end (delta: 25.9 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,561 INFO L168 Benchmark]: CDTParser took 0.49 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 14:56:27,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.02 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,563 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,564 INFO L168 Benchmark]: RCFGBuilder took 461.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,565 INFO L168 Benchmark]: TraceAbstraction took 1155.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 944.0 MB in the end (delta: 90.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,565 INFO L168 Benchmark]: Witness Printer took 73.33 ms. Allocated memory is still 1.1 GB. Free memory was 944.0 MB in the beginning and 937.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-28 14:56:27,569 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.49 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 372.02 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 461.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1155.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 944.0 MB in the end (delta: 90.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.33 ms. Allocated memory is still 1.1 GB. Free memory was 944.0 MB in the beginning and 937.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L11] COND FALSE !(!cond) VAL [N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = N [L30] i=0 VAL [N=1] [L30] COND TRUE i