./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condaf.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/condaf.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 5f421558c232a0b95640bb271259e92ac7772c7a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:49:05,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:49:05,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:49:05,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:49:05,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:49:05,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:49:05,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:49:05,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:49:05,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:49:05,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:49:05,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:49:05,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:49:05,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:49:05,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:49:05,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:49:05,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:49:05,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:49:05,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:49:05,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:49:05,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:49:05,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:49:05,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:49:05,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:49:05,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:49:05,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:49:05,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:49:05,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:49:05,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:49:05,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:49:05,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:49:05,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:49:05,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:49:05,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:49:05,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:49:05,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:49:05,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:49:05,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:49:05,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:49:05,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:49:05,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:49:05,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:49:05,343 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:49:05,384 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:49:05,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:49:05,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:49:05,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:49:05,389 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:49:05,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:49:05,389 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:49:05,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:49:05,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:49:05,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:49:05,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:49:05,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:49:05,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:49:05,391 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:49:05,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:49:05,393 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:49:05,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:49:05,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:49:05,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:49:05,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:49:05,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:49:05,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:49:05,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:49:05,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:49:05,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:49:05,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:49:05,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:49:05,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:49:05,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:49:05,399 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 -> 5f421558c232a0b95640bb271259e92ac7772c7a [2020-07-28 14:49:05,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:49:05,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:49:05,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:49:05,739 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:49:05,742 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:49:05,743 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condaf.c [2020-07-28 14:49:05,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6723513f2/9fa821540b254872a35d4521beb265fa/FLAG16837f337 [2020-07-28 14:49:06,268 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:49:06,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condaf.c [2020-07-28 14:49:06,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6723513f2/9fa821540b254872a35d4521beb265fa/FLAG16837f337 [2020-07-28 14:49:06,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6723513f2/9fa821540b254872a35d4521beb265fa [2020-07-28 14:49:06,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:49:06,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:49:06,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:49:06,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:49:06,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:49:06,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:06,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1182415f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06, skipping insertion in model container [2020-07-28 14:49:06,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:06,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:49:06,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:49:06,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:49:06,878 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:49:06,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:49:06,919 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:49:06,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06 WrapperNode [2020-07-28 14:49:06,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:49:06,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:49:06,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:49:06,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:49:06,928 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:49:06" (1/1) ... [2020-07-28 14:49:07,004 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:49:06" (1/1) ... [2020-07-28 14:49:07,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:49:07,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:49:07,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:49:07,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:49:07,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (1/1) ... [2020-07-28 14:49:07,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:49:07,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:49:07,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:49:07,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:49:07,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (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:49:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:49:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:49:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:49:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:49:07,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:49:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:49:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:49:07,503 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:49:07,504 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:49:07,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:07 BoogieIcfgContainer [2020-07-28 14:49:07,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:49:07,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:49:07,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:49:07,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:49:07,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:49:06" (1/3) ... [2020-07-28 14:49:07,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577cfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:49:07, skipping insertion in model container [2020-07-28 14:49:07,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:49:06" (2/3) ... [2020-07-28 14:49:07,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577cfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:49:07, skipping insertion in model container [2020-07-28 14:49:07,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:07" (3/3) ... [2020-07-28 14:49:07,517 INFO L109 eAbstractionObserver]: Analyzing ICFG condaf.c [2020-07-28 14:49:07,528 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:49:07,545 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:49:07,558 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:49:07,577 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:49:07,578 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:49:07,578 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:49:07,578 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:49:07,578 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:49:07,578 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:49:07,578 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:49:07,578 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:49:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-28 14:49:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:49:07,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:07,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:07,600 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2020-07-28 14:49:07,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:07,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981224269] [2020-07-28 14:49:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:07,759 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:49:07,760 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:49:07,760 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:49:07,762 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:49:07,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(4);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(0, main_~#sum~0.base, main_~#sum~0.offset, 4);main_~i~0 := 0; {26#false} is VALID [2020-07-28 14:49:07,763 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#false} assume !(main_~i~0 < ~N~0); {26#false} is VALID [2020-07-28 14:49:07,763 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#false} main_~i~0 := 0; {26#false} is VALID [2020-07-28 14:49:07,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#false} assume !(main_~i~0 < ~N~0); {26#false} is VALID [2020-07-28 14:49:07,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {26#false} main_~i~0 := 0; {26#false} is VALID [2020-07-28 14:49:07,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {26#false} assume !(main_~i~0 < ~N~0); {26#false} is VALID [2020-07-28 14:49:07,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {26#false} call main_#t~mem10 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem10 == 2 * ~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:49:07,766 INFO L280 TraceCheckUtils]: 11: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond; {26#false} is VALID [2020-07-28 14:49:07,766 INFO L280 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-28 14:49:07,769 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:49:07,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981224269] [2020-07-28 14:49:07,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:07,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:49:07,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740111048] [2020-07-28 14:49:07,779 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 14:49:07,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:07,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:49:07,870 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:49:07,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:49:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:07,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:49:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:49:07,889 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2020-07-28 14:49:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:07,993 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-07-28 14:49:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:49:07,994 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 14:49:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:49:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2020-07-28 14:49:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:49:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2020-07-28 14:49:08,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2020-07-28 14:49:08,168 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:49:08,188 INFO L225 Difference]: With dead ends: 40 [2020-07-28 14:49:08,188 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 14:49:08,195 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:49:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 14:49:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 14:49:08,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:08,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 14:49:08,236 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 14:49:08,237 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 14:49:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:08,239 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 14:49:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-28 14:49:08,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:08,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:08,241 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 14:49:08,241 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 14:49:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:08,246 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 14:49:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-28 14:49:08,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:08,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:08,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:08,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 14:49:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-07-28 14:49:08,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2020-07-28 14:49:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:08,254 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-28 14:49:08,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:49:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-28 14:49:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:49:08,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:08,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:49:08,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:49:08,256 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2020-07-28 14:49:08,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:08,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286140112] [2020-07-28 14:49:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:08,353 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:49:08,353 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:49:08,354 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:49:08,355 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:49:08,357 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(4);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(0, main_~#sum~0.base, main_~#sum~0.offset, 4);main_~i~0 := 0; {137#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:49:08,358 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:49:08,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {135#false} main_~i~0 := 0; {135#false} is VALID [2020-07-28 14:49:08,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {135#false} assume !(main_~i~0 < ~N~0); {135#false} is VALID [2020-07-28 14:49:08,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {135#false} main_~i~0 := 0; {135#false} is VALID [2020-07-28 14:49:08,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {135#false} assume !(main_~i~0 < ~N~0); {135#false} is VALID [2020-07-28 14:49:08,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {135#false} call main_#t~mem10 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem10 == 2 * ~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:49:08,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {135#false} assume 0 == __VERIFIER_assert_~cond; {135#false} is VALID [2020-07-28 14:49:08,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {135#false} assume !false; {135#false} is VALID [2020-07-28 14:49:08,362 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:49:08,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286140112] [2020-07-28 14:49:08,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:49:08,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:49:08,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814747363] [2020-07-28 14:49:08,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-28 14:49:08,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:08,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:49:08,388 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:49:08,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:49:08,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:49:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:49:08,389 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 4 states. [2020-07-28 14:49:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:08,537 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-28 14:49:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:49:08,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-28 14:49:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:49:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-28 14:49:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:49:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-28 14:49:08,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2020-07-28 14:49:08,621 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:49:08,623 INFO L225 Difference]: With dead ends: 36 [2020-07-28 14:49:08,624 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 14:49:08,625 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:49:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 14:49:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2020-07-28 14:49:08,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:08,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 21 states. [2020-07-28 14:49:08,645 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 21 states. [2020-07-28 14:49:08,645 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 21 states. [2020-07-28 14:49:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:08,650 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:49:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:49:08,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:08,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:08,652 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 25 states. [2020-07-28 14:49:08,652 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 25 states. [2020-07-28 14:49:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:08,655 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:49:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:49:08,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:08,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:08,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:08,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 14:49:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-28 14:49:08,661 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2020-07-28 14:49:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:08,662 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-28 14:49:08,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:49:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 14:49:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:49:08,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:08,663 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:49:08,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:49:08,664 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2020-07-28 14:49:08,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:08,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098599014] [2020-07-28 14:49:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:09,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {261#true} is VALID [2020-07-28 14:49:09,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {261#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; {261#true} is VALID [2020-07-28 14:49:09,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {261#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; {263#(or (= 1 ULTIMATE.start_assume_abort_if_not_~cond) (<= 536870912 ~N~0))} is VALID [2020-07-28 14:49:09,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {263#(or (= 1 ULTIMATE.start_assume_abort_if_not_~cond) (<= 536870912 ~N~0))} assume !(0 == assume_abort_if_not_~cond); {261#true} is VALID [2020-07-28 14:49:09,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {261#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(4);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(0, main_~#sum~0.base, main_~#sum~0.offset, 4);main_~i~0 := 0; {264#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,230 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {265#(and (= 0 ULTIMATE.start_main_~i~0) (or (not (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))))) (<= 536870912 ~N~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(and (= 0 ULTIMATE.start_main_~i~0) (or (not (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))))) (<= 536870912 ~N~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {266#(and (or (and (not (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0)) (<= ~N~0 536870911)) (<= (+ ULTIMATE.start_main_~i~0 536870911) ~N~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,234 INFO L280 TraceCheckUtils]: 7: Hoare triple {266#(and (or (and (not (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0)) (<= ~N~0 536870911)) (<= (+ ULTIMATE.start_main_~i~0 536870911) ~N~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !(main_~i~0 < ~N~0); {267#(and (not (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0)) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {267#(and (not (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0)) (= 0 ULTIMATE.start_main_~a~0.offset))} main_~i~0 := 0; {268#(and (= 0 ULTIMATE.start_main_~i~0) (not (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))))) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {268#(and (= 0 ULTIMATE.start_main_~i~0) (not (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))))) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {269#(not (= 0 |ULTIMATE.start_main_#t~mem4|))} is VALID [2020-07-28 14:49:09,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {269#(not (= 0 |ULTIMATE.start_main_#t~mem4|))} assume 0 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(1 + main_#t~mem5, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem5; {262#false} is VALID [2020-07-28 14:49:09,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {262#false} is VALID [2020-07-28 14:49:09,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#false} assume !(main_~i~0 < ~N~0); {262#false} is VALID [2020-07-28 14:49:09,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#false} main_~i~0 := 0; {262#false} is VALID [2020-07-28 14:49:09,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem8 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 4);call main_#t~mem9 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~#sum~0.base, main_~#sum~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9; {262#false} is VALID [2020-07-28 14:49:09,241 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#false} main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; {262#false} is VALID [2020-07-28 14:49:09,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {262#false} assume !(main_~i~0 < ~N~0); {262#false} is VALID [2020-07-28 14:49:09,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {262#false} call main_#t~mem10 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem10 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {262#false} is VALID [2020-07-28 14:49:09,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond; {262#false} is VALID [2020-07-28 14:49:09,242 INFO L280 TraceCheckUtils]: 19: Hoare triple {262#false} assume !false; {262#false} is VALID [2020-07-28 14:49:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:49:09,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098599014] [2020-07-28 14:49:09,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688086857] [2020-07-28 14:49:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:49:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:09,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 14:49:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:49:09,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:49:09,451 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-28 14:49:09,452 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:09,460 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:09,460 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:49:09,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-28 14:49:09,538 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-28 14:49:09,539 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:49:09,548 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:49:09,548 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:49:09,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-28 14:49:09,552 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:49:09,552 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (and (<= .cse0 |ULTIMATE.start_main_#t~mem4|) (= 1 .cse0))) [2020-07-28 14:49:09,553 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |ULTIMATE.start_main_#t~mem4|) [2020-07-28 14:49:09,614 INFO L280 TraceCheckUtils]: 0: Hoare triple {261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {261#true} is VALID [2020-07-28 14:49:09,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {261#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; {261#true} is VALID [2020-07-28 14:49:09,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {261#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; {261#true} is VALID [2020-07-28 14:49:09,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {261#true} assume !(0 == assume_abort_if_not_~cond); {261#true} is VALID [2020-07-28 14:49:09,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {261#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(4);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(0, main_~#sum~0.base, main_~#sum~0.offset, 4);main_~i~0 := 0; {285#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:49:09,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {285#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {289#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {289#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {289#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,621 INFO L280 TraceCheckUtils]: 7: Hoare triple {289#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))} assume !(main_~i~0 < ~N~0); {289#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:49:09,622 INFO L280 TraceCheckUtils]: 8: Hoare triple {289#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))} main_~i~0 := 0; {299#(and (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2020-07-28 14:49:09,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#(and (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {303#(<= 1 |ULTIMATE.start_main_#t~mem4|)} is VALID [2020-07-28 14:49:09,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {303#(<= 1 |ULTIMATE.start_main_#t~mem4|)} assume 0 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(1 + main_#t~mem5, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem5; {262#false} is VALID [2020-07-28 14:49:09,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {262#false} is VALID [2020-07-28 14:49:09,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#false} assume !(main_~i~0 < ~N~0); {262#false} is VALID [2020-07-28 14:49:09,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#false} main_~i~0 := 0; {262#false} is VALID [2020-07-28 14:49:09,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem8 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 4);call main_#t~mem9 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~#sum~0.base, main_~#sum~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9; {262#false} is VALID [2020-07-28 14:49:09,627 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#false} main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; {262#false} is VALID [2020-07-28 14:49:09,627 INFO L280 TraceCheckUtils]: 16: Hoare triple {262#false} assume !(main_~i~0 < ~N~0); {262#false} is VALID [2020-07-28 14:49:09,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {262#false} call main_#t~mem10 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem10 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {262#false} is VALID [2020-07-28 14:49:09,628 INFO L280 TraceCheckUtils]: 18: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond; {262#false} is VALID [2020-07-28 14:49:09,629 INFO L280 TraceCheckUtils]: 19: Hoare triple {262#false} assume !false; {262#false} is VALID [2020-07-28 14:49:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:49:09,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:49:09,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2020-07-28 14:49:09,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107386853] [2020-07-28 14:49:09,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-28 14:49:09,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:49:09,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 14:49:09,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:49:09,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 14:49:09,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:49:09,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 14:49:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-28 14:49:09,678 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 13 states. [2020-07-28 14:49:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:10,364 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2020-07-28 14:49:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 14:49:10,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-28 14:49:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:49:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 14:49:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-28 14:49:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 14:49:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-28 14:49:10,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2020-07-28 14:49:10,490 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:49:10,494 INFO L225 Difference]: With dead ends: 39 [2020-07-28 14:49:10,495 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 14:49:10,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-07-28 14:49:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 14:49:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2020-07-28 14:49:10,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:49:10,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 22 states. [2020-07-28 14:49:10,524 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 22 states. [2020-07-28 14:49:10,524 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 22 states. [2020-07-28 14:49:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:10,528 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-28 14:49:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-28 14:49:10,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:10,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:10,530 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 28 states. [2020-07-28 14:49:10,530 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 28 states. [2020-07-28 14:49:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:49:10,538 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-28 14:49:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-28 14:49:10,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:49:10,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:49:10,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:49:10,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:49:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:49:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-07-28 14:49:10,542 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2020-07-28 14:49:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:49:10,542 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-28 14:49:10,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 14:49:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-28 14:49:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:49:10,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:49:10,545 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:49:10,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:49:10,756 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:49:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:49:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2020-07-28 14:49:10,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:49:10,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802657514] [2020-07-28 14:49:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:49:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:49:10,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:49:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:49:10,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:49:10,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:49:10,833 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:49:10,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 14:49:10,876 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:49:10,876 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:49:10,877 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:49:10,877 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:49:10,877 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 14:49:10,877 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:49:10,877 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:49:10,877 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:49:10,878 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:49:10,878 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:49:10,878 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:49:10,878 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:49:10,879 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:49:10,879 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:49:10,879 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:49:10,879 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:49:10,880 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:49:10,880 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 14:49:10,880 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:49:10,880 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:49:10,880 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:49:10,881 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:49:10,881 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:49:10,881 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 14:49:10,881 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-28 14:49:10,881 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-28 14:49:10,882 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:49:10,882 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:49:10,882 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:49:10,883 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:49:10,883 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:49:10,883 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:49:10,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:49:10 BoogieIcfgContainer [2020-07-28 14:49:10,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:49:10,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:49:10,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:49:10,887 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:49:10,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:49:07" (3/4) ... [2020-07-28 14:49:10,890 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:49:10,959 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:49:10,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:49:10,962 INFO L168 Benchmark]: Toolchain (without parser) took 4316.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:49:10,963 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:49:10,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.47 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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:49:10,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:10,964 INFO L168 Benchmark]: Boogie Preprocessor took 26.82 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 14:49:10,965 INFO L168 Benchmark]: RCFGBuilder took 433.45 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:10,966 INFO L168 Benchmark]: TraceAbstraction took 3376.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:49:10,967 INFO L168 Benchmark]: Witness Printer took 73.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:49:10,970 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.83 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.47 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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 126.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.82 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 433.45 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3376.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 73.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 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] int sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 0 [L30] i=0 VAL [N=1] [L30] COND TRUE i