./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/skippedu.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-tiling/skippedu.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 76c1400d33285b0b0497d09d8de78f15f44bd464 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:32:28,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:32:28,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:32:28,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:32:28,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:32:28,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:32:28,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:32:28,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:32:28,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:32:28,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:32:28,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:32:28,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:32:28,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:32:28,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:32:28,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:32:28,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:32:28,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:32:28,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:32:28,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:32:28,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:32:28,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:32:28,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:32:28,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:32:28,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:32:28,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:32:28,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:32:28,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:32:28,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:32:28,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:32:28,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:32:28,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:32:28,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:32:28,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:32:28,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:32:28,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:32:28,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:32:28,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:32:28,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:32:28,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:32:28,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:32:28,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:32:28,813 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:32:28,829 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:32:28,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:32:28,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:32:28,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:32:28,832 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:32:28,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:32:28,832 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:32:28,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:32:28,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:32:28,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:32:28,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:32:28,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:32:28,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:32:28,834 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:32:28,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:32:28,835 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:32:28,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:32:28,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:32:28,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:32:28,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:32:28,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:32:28,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:32:28,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:32:28,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:32:28,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:32:28,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:32:28,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:32:28,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:32:28,839 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:32:28,839 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 -> 76c1400d33285b0b0497d09d8de78f15f44bd464 [2020-07-28 14:32:29,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:32:29,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:32:29,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:32:29,223 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:32:29,225 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:32:29,226 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/skippedu.c [2020-07-28 14:32:29,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f3c133a/41f1a13edb2f48f0941bfad67fdbe7f9/FLAGf54c59090 [2020-07-28 14:32:29,790 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:32:29,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/skippedu.c [2020-07-28 14:32:29,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f3c133a/41f1a13edb2f48f0941bfad67fdbe7f9/FLAGf54c59090 [2020-07-28 14:32:30,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f3c133a/41f1a13edb2f48f0941bfad67fdbe7f9 [2020-07-28 14:32:30,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:32:30,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:32:30,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:32:30,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:32:30,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:32:30,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aed57f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30, skipping insertion in model container [2020-07-28 14:32:30,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:32:30,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:32:30,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:32:30,502 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:32:30,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:32:30,558 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:32:30,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30 WrapperNode [2020-07-28 14:32:30,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:32:30,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:32:30,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:32:30,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:32:30,628 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:32:30" (1/1) ... [2020-07-28 14:32:30,638 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:32:30" (1/1) ... [2020-07-28 14:32:30,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:32:30,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:32:30,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:32:30,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:32:30,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (1/1) ... [2020-07-28 14:32:30,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:32:30,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:32:30,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:32:30,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:32:30,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (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:32:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:32:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:32:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:32:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:32:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:32:31,207 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:32:31,207 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:32:31,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:32:31 BoogieIcfgContainer [2020-07-28 14:32:31,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:32:31,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:32:31,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:32:31,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:32:31,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:32:30" (1/3) ... [2020-07-28 14:32:31,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fa9471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:32:31, skipping insertion in model container [2020-07-28 14:32:31,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:32:30" (2/3) ... [2020-07-28 14:32:31,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fa9471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:32:31, skipping insertion in model container [2020-07-28 14:32:31,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:32:31" (3/3) ... [2020-07-28 14:32:31,222 INFO L109 eAbstractionObserver]: Analyzing ICFG skippedu.c [2020-07-28 14:32:31,234 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:32:31,243 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:32:31,259 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:32:31,286 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:32:31,286 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:32:31,287 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:32:31,287 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:32:31,289 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:32:31,289 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:32:31,289 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:32:31,289 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:32:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-28 14:32:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 14:32:31,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:32:31,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:32:31,315 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:32:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:32:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1607783550, now seen corresponding path program 1 times [2020-07-28 14:32:31,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:32:31,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867774059] [2020-07-28 14:32:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:32:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:31,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {27#true} is VALID [2020-07-28 14:32:31,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {27#true} is VALID [2020-07-28 14:32:31,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {27#true} is VALID [2020-07-28 14:32:31,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-28 14:32:31,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {28#false} is VALID [2020-07-28 14:32:31,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} assume 0 == assume_abort_if_not_~cond;assume false; {28#false} is VALID [2020-07-28 14:32:31,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#false} main_~i~0 := 1; {28#false} is VALID [2020-07-28 14:32:31,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {28#false} is VALID [2020-07-28 14:32:31,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#false} main_~i~0 := 0; {28#false} is VALID [2020-07-28 14:32:31,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {28#false} is VALID [2020-07-28 14:32:31,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == __VERIFIER_assert_~cond; {28#false} is VALID [2020-07-28 14:32:31,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-28 14:32:31,499 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:32:31,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867774059] [2020-07-28 14:32:31,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:32:31,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:32:31,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069009626] [2020-07-28 14:32:31,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 14:32:31,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:32:31,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:32:31,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:31,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:32:31,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:32:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:32:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:32:31,608 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-28 14:32:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:31,714 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2020-07-28 14:32:31,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:32:31,715 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 14:32:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:32:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:32:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2020-07-28 14:32:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:32:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2020-07-28 14:32:31,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2020-07-28 14:32:31,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:31,955 INFO L225 Difference]: With dead ends: 43 [2020-07-28 14:32:31,955 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 14:32:31,961 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:32:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 14:32:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 14:32:32,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:32:32,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 14:32:32,007 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 14:32:32,007 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 14:32:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:32,013 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-28 14:32:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 14:32:32,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:32,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:32,015 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 14:32:32,015 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 14:32:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:32,021 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-28 14:32:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 14:32:32,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:32,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:32,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:32:32,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:32:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 14:32:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-07-28 14:32:32,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2020-07-28 14:32:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:32:32,043 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-28 14:32:32,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:32:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 14:32:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 14:32:32,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:32:32,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:32:32,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:32:32,047 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:32:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:32:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1872951298, now seen corresponding path program 1 times [2020-07-28 14:32:32,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:32:32,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083189095] [2020-07-28 14:32:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:32:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:32,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {144#true} is VALID [2020-07-28 14:32:32,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {144#true} is VALID [2020-07-28 14:32:32,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {144#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {146#(and (<= 2 ~SIZE~0) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:32:32,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {146#(and (<= 2 ~SIZE~0) (= 0 ULTIMATE.start_main_~i~0))} assume !(main_~i~0 < ~SIZE~0); {145#false} is VALID [2020-07-28 14:32:32,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {145#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {145#false} is VALID [2020-07-28 14:32:32,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {145#false} assume !(0 == assume_abort_if_not_~cond); {145#false} is VALID [2020-07-28 14:32:32,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {145#false} main_~i~0 := 1; {145#false} is VALID [2020-07-28 14:32:32,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {145#false} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {145#false} is VALID [2020-07-28 14:32:32,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {145#false} main_~i~0 := 0; {145#false} is VALID [2020-07-28 14:32:32,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {145#false} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {145#false} is VALID [2020-07-28 14:32:32,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {145#false} assume 0 == __VERIFIER_assert_~cond; {145#false} is VALID [2020-07-28 14:32:32,199 INFO L280 TraceCheckUtils]: 11: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-28 14:32:32,200 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:32:32,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083189095] [2020-07-28 14:32:32,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:32:32,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 14:32:32,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389443423] [2020-07-28 14:32:32,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 14:32:32,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:32:32,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:32:32,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:32,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:32:32,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:32:32,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:32:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:32:32,233 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2020-07-28 14:32:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:32,332 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-28 14:32:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:32:32,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 14:32:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:32:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:32:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-28 14:32:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:32:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-28 14:32:32,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2020-07-28 14:32:32,412 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:32:32,413 INFO L225 Difference]: With dead ends: 37 [2020-07-28 14:32:32,414 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 14:32:32,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:32:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 14:32:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-28 14:32:32,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:32:32,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-28 14:32:32,435 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-28 14:32:32,435 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-28 14:32:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:32,438 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-28 14:32:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 14:32:32,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:32,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:32,440 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-28 14:32:32,441 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-28 14:32:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:32,444 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-28 14:32:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 14:32:32,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:32,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:32,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:32:32,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:32:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 14:32:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-28 14:32:32,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2020-07-28 14:32:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:32:32,451 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-28 14:32:32,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:32:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-28 14:32:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 14:32:32,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:32:32,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:32:32,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:32:32,454 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:32:32,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:32:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash -270152420, now seen corresponding path program 1 times [2020-07-28 14:32:32,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:32:32,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910137587] [2020-07-28 14:32:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:32:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:32,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {261#true} is VALID [2020-07-28 14:32:32,586 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~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {261#true} is VALID [2020-07-28 14:32:32,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {261#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {263#(and (<= 2 ~SIZE~0) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:32:32,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {263#(and (<= 2 ~SIZE~0) (= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {263#(and (<= 2 ~SIZE~0) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:32:32,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {263#(and (<= 2 ~SIZE~0) (= 0 ULTIMATE.start_main_~i~0))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {264#(<= (+ ULTIMATE.start_main_~i~0 1) ~SIZE~0)} is VALID [2020-07-28 14:32:32,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#(<= (+ ULTIMATE.start_main_~i~0 1) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {262#false} is VALID [2020-07-28 14:32:32,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {262#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#false} is VALID [2020-07-28 14:32:32,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {262#false} assume !(0 == assume_abort_if_not_~cond); {262#false} is VALID [2020-07-28 14:32:32,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#false} main_~i~0 := 1; {262#false} is VALID [2020-07-28 14:32:32,595 INFO L280 TraceCheckUtils]: 9: Hoare triple {262#false} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {262#false} is VALID [2020-07-28 14:32:32,596 INFO L280 TraceCheckUtils]: 10: Hoare triple {262#false} main_~i~0 := 0; {262#false} is VALID [2020-07-28 14:32:32,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#false} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {262#false} is VALID [2020-07-28 14:32:32,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond; {262#false} is VALID [2020-07-28 14:32:32,597 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#false} assume !false; {262#false} is VALID [2020-07-28 14:32:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:32:32,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910137587] [2020-07-28 14:32:32,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522174174] [2020-07-28 14:32:32,599 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:32:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:32,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 14:32:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:32,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:32:32,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {261#true} is VALID [2020-07-28 14:32:32,851 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~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {261#true} is VALID [2020-07-28 14:32:32,852 INFO L280 TraceCheckUtils]: 2: Hoare triple {261#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {274#(and (< 1 ~SIZE~0) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-28 14:32:32,854 INFO L280 TraceCheckUtils]: 3: Hoare triple {274#(and (< 1 ~SIZE~0) (<= ULTIMATE.start_main_~i~0 0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {274#(and (< 1 ~SIZE~0) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-28 14:32:32,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {274#(and (< 1 ~SIZE~0) (<= ULTIMATE.start_main_~i~0 0))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {281#(and (< 1 ~SIZE~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:32:32,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {281#(and (< 1 ~SIZE~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < ~SIZE~0); {262#false} is VALID [2020-07-28 14:32:32,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {262#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#false} is VALID [2020-07-28 14:32:32,857 INFO L280 TraceCheckUtils]: 7: Hoare triple {262#false} assume !(0 == assume_abort_if_not_~cond); {262#false} is VALID [2020-07-28 14:32:32,857 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#false} main_~i~0 := 1; {262#false} is VALID [2020-07-28 14:32:32,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {262#false} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {262#false} is VALID [2020-07-28 14:32:32,858 INFO L280 TraceCheckUtils]: 10: Hoare triple {262#false} main_~i~0 := 0; {262#false} is VALID [2020-07-28 14:32:32,858 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#false} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {262#false} is VALID [2020-07-28 14:32:32,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond; {262#false} is VALID [2020-07-28 14:32:32,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#false} assume !false; {262#false} is VALID [2020-07-28 14:32:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:32:32,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:32:32,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-28 14:32:32,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732194036] [2020-07-28 14:32:32,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-28 14:32:32,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:32:32,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 14:32:32,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:32,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 14:32:32,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:32:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 14:32:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:32:32,892 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-07-28 14:32:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:33,067 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-07-28 14:32:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:32:33,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-28 14:32:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:32:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:32:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-28 14:32:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:32:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-28 14:32:33,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2020-07-28 14:32:33,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:33,150 INFO L225 Difference]: With dead ends: 39 [2020-07-28 14:32:33,151 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 14:32:33,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:32:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 14:32:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-28 14:32:33,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:32:33,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-28 14:32:33,160 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-28 14:32:33,161 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-28 14:32:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:33,163 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-28 14:32:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-28 14:32:33,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:33,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:33,164 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-28 14:32:33,164 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-28 14:32:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:33,166 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-28 14:32:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-28 14:32:33,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:33,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:33,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:32:33,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:32:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 14:32:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-28 14:32:33,170 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2020-07-28 14:32:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:32:33,170 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-28 14:32:33,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 14:32:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-28 14:32:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 14:32:33,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:32:33,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:32:33,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:32:33,385 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:32:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:32:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1873689926, now seen corresponding path program 2 times [2020-07-28 14:32:33,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:32:33,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256248384] [2020-07-28 14:32:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:32:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:33,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {430#true} is VALID [2020-07-28 14:32:33,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {430#true} is VALID [2020-07-28 14:32:33,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {430#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {432#(<= 2 ~SIZE~0)} is VALID [2020-07-28 14:32:33,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {432#(<= 2 ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {432#(<= 2 ~SIZE~0)} is VALID [2020-07-28 14:32:33,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {432#(<= 2 ~SIZE~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {432#(<= 2 ~SIZE~0)} is VALID [2020-07-28 14:32:33,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {432#(<= 2 ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {432#(<= 2 ~SIZE~0)} is VALID [2020-07-28 14:32:33,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {432#(<= 2 ~SIZE~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {432#(<= 2 ~SIZE~0)} is VALID [2020-07-28 14:32:33,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {432#(<= 2 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {432#(<= 2 ~SIZE~0)} is VALID [2020-07-28 14:32:33,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {432#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {433#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2020-07-28 14:32:33,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {433#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} assume !(0 == assume_abort_if_not_~cond); {433#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2020-07-28 14:32:33,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {433#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} main_~i~0 := 1; {434#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 14:32:33,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (= 1 ULTIMATE.start_main_~i~0))} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {431#false} is VALID [2020-07-28 14:32:33,631 INFO L280 TraceCheckUtils]: 12: Hoare triple {431#false} main_~i~0 := 0; {431#false} is VALID [2020-07-28 14:32:33,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {431#false} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {431#false} is VALID [2020-07-28 14:32:33,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {431#false} assume 0 == __VERIFIER_assert_~cond; {431#false} is VALID [2020-07-28 14:32:33,632 INFO L280 TraceCheckUtils]: 15: Hoare triple {431#false} assume !false; {431#false} is VALID [2020-07-28 14:32:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 14:32:33,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256248384] [2020-07-28 14:32:33,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:32:33,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 14:32:33,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990864987] [2020-07-28 14:32:33,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-28 14:32:33,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:32:33,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:32:33,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:33,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:32:33,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:32:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:32:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:32:33,657 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2020-07-28 14:32:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:33,836 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-28 14:32:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:32:33,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-28 14:32:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:32:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:32:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-28 14:32:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:32:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-28 14:32:33,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2020-07-28 14:32:33,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:33,912 INFO L225 Difference]: With dead ends: 35 [2020-07-28 14:32:33,912 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 14:32:33,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:32:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 14:32:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-07-28 14:32:33,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:32:33,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 24 states. [2020-07-28 14:32:33,928 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 24 states. [2020-07-28 14:32:33,928 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 24 states. [2020-07-28 14:32:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:33,930 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-28 14:32:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-28 14:32:33,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:33,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:33,932 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 28 states. [2020-07-28 14:32:33,932 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 28 states. [2020-07-28 14:32:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:33,934 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-28 14:32:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-28 14:32:33,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:33,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:33,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:32:33,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:32:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 14:32:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-28 14:32:33,938 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2020-07-28 14:32:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:32:33,938 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-28 14:32:33,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:32:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-28 14:32:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:32:33,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:32:33,940 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:32:33,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 14:32:33,940 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:32:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:32:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1095507628, now seen corresponding path program 1 times [2020-07-28 14:32:33,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:32:33,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117527232] [2020-07-28 14:32:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:32:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:34,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {565#true} is VALID [2020-07-28 14:32:34,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {565#true} is VALID [2020-07-28 14:32:34,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {565#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,227 INFO L280 TraceCheckUtils]: 4: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,228 INFO L280 TraceCheckUtils]: 5: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,229 INFO L280 TraceCheckUtils]: 6: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,229 INFO L280 TraceCheckUtils]: 7: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !(main_~i~0 < ~SIZE~0); {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,231 INFO L280 TraceCheckUtils]: 9: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} assume !(0 == assume_abort_if_not_~cond); {567#(= 0 ULTIMATE.start_main_~a~0.offset)} is VALID [2020-07-28 14:32:34,232 INFO L280 TraceCheckUtils]: 10: Hoare triple {567#(= 0 ULTIMATE.start_main_~a~0.offset)} main_~i~0 := 1; {568#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:32:34,234 INFO L280 TraceCheckUtils]: 11: Hoare triple {568#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 2), 4); {568#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:32:34,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {568#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume main_#t~mem5 > main_~i~0;havoc main_#t~mem5;call write~int(2 * main_~i~0 - 2, main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 2), 4); {569#(and (= 0 (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 4)) (+ (* ULTIMATE.start_main_~i~0 2) (- 1))) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8)))) (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:32:34,237 INFO L280 TraceCheckUtils]: 13: Hoare triple {569#(and (= 0 (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 4)) (+ (* ULTIMATE.start_main_~i~0 2) (- 1))) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8)))) (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 1), 4); {569#(and (= 0 (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 4)) (+ (* ULTIMATE.start_main_~i~0 2) (- 1))) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8)))) (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:32:34,245 INFO L280 TraceCheckUtils]: 14: Hoare triple {569#(and (= 0 (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 4)) (+ (* ULTIMATE.start_main_~i~0 2) (- 1))) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8)))) (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume main_#t~mem6 > main_~i~0;havoc main_#t~mem6;call write~int(2 * main_~i~0 - 1, main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 1), 4); {570#(and (= (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:32:34,248 INFO L280 TraceCheckUtils]: 15: Hoare triple {570#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0) (= 0 ULTIMATE.start_main_~a~0.offset))} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {570#(and (= (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:32:34,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {570#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {570#(and (= (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:32:34,251 INFO L280 TraceCheckUtils]: 17: Hoare triple {570#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 0) (= 0 ULTIMATE.start_main_~a~0.offset))} main_~i~0 := 0; {571#(and (= 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_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-28 14:32:34,252 INFO L280 TraceCheckUtils]: 18: Hoare triple {571#(and (= 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_~i~0) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {572#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 14:32:34,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {572#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {566#false} is VALID [2020-07-28 14:32:34,254 INFO L280 TraceCheckUtils]: 20: Hoare triple {566#false} assume !false; {566#false} is VALID [2020-07-28 14:32:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 14:32:34,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117527232] [2020-07-28 14:32:34,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174550937] [2020-07-28 14:32:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:32:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:34,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 14:32:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:32:34,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:32:34,383 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 20 treesize of output 16 [2020-07-28 14:32:34,384 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:32:34,396 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:32:34,397 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:32:34,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-07-28 14:32:34,485 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-07-28 14:32:34,486 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2020-07-28 14:32:34,487 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:32:34,496 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:32:34,497 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:32:34,497 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-28 14:32:34,638 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:32:34,666 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:32:34,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~SIZE~0 := 0;~MAX~0 := 100000; {565#true} is VALID [2020-07-28 14:32:34,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~mem6, main_#t~post4, main_#t~mem8, main_#t~post7, main_~i~0, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0; {565#true} is VALID [2020-07-28 14:32:34,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {565#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {565#true} is VALID [2020-07-28 14:32:34,714 INFO L280 TraceCheckUtils]: 3: Hoare triple {565#true} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {565#true} is VALID [2020-07-28 14:32:34,714 INFO L280 TraceCheckUtils]: 4: Hoare triple {565#true} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {565#true} is VALID [2020-07-28 14:32:34,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {565#true} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;call write~int(main_#t~nondet3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet3; {565#true} is VALID [2020-07-28 14:32:34,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {565#true} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {565#true} is VALID [2020-07-28 14:32:34,715 INFO L280 TraceCheckUtils]: 7: Hoare triple {565#true} assume !(main_~i~0 < ~SIZE~0); {565#true} is VALID [2020-07-28 14:32:34,715 INFO L280 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume_abort_if_not_#in~cond := (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {565#true} is VALID [2020-07-28 14:32:34,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {565#true} assume !(0 == assume_abort_if_not_~cond); {565#true} is VALID [2020-07-28 14:32:34,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {565#true} main_~i~0 := 1; {606#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:32:34,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#(= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 2), 4); {606#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:32:34,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {606#(= 1 ULTIMATE.start_main_~i~0)} assume main_#t~mem5 > main_~i~0;havoc main_#t~mem5;call write~int(2 * main_~i~0 - 2, main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 2), 4); {613#(and (= 1 ULTIMATE.start_main_~i~0) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 2) (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 14:32:34,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {613#(and (= 1 ULTIMATE.start_main_~i~0) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 2) (* 2 ULTIMATE.start_main_~i~0)))} call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 1), 4); {613#(and (= 1 ULTIMATE.start_main_~i~0) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 2) (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 14:32:34,722 INFO L280 TraceCheckUtils]: 14: Hoare triple {613#(and (= 1 ULTIMATE.start_main_~i~0) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 8) (- 8))) 2) (* 2 ULTIMATE.start_main_~i~0)))} assume main_#t~mem6 > main_~i~0;havoc main_#t~mem6;call write~int(2 * main_~i~0 - 1, main_~a~0.base, main_~a~0.offset + 4 * (2 * main_~i~0 - 1), 4); {620#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2020-07-28 14:32:34,723 INFO L280 TraceCheckUtils]: 15: Hoare triple {620#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {620#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2020-07-28 14:32:34,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {620#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {620#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2020-07-28 14:32:34,725 INFO L280 TraceCheckUtils]: 17: Hoare triple {620#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_~i~0 := 0; {630#(and (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2020-07-28 14:32:34,726 INFO L280 TraceCheckUtils]: 18: Hoare triple {630#(and (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 4))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem8 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {634#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:32:34,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {634#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {566#false} is VALID [2020-07-28 14:32:34,727 INFO L280 TraceCheckUtils]: 20: Hoare triple {566#false} assume !false; {566#false} is VALID [2020-07-28 14:32:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 14:32:34,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:32:34,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-07-28 14:32:34,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787952156] [2020-07-28 14:32:34,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-07-28 14:32:34,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:32:34,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 14:32:34,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:34,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 14:32:34,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:32:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 14:32:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-28 14:32:34,786 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 13 states. [2020-07-28 14:32:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:36,069 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2020-07-28 14:32:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-28 14:32:36,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-07-28 14:32:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:32:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 14:32:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2020-07-28 14:32:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 14:32:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2020-07-28 14:32:36,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2020-07-28 14:32:36,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:32:36,199 INFO L225 Difference]: With dead ends: 78 [2020-07-28 14:32:36,199 INFO L226 Difference]: Without dead ends: 76 [2020-07-28 14:32:36,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2020-07-28 14:32:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-28 14:32:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 45. [2020-07-28 14:32:36,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:32:36,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 45 states. [2020-07-28 14:32:36,245 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 45 states. [2020-07-28 14:32:36,245 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 45 states. [2020-07-28 14:32:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:36,249 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2020-07-28 14:32:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2020-07-28 14:32:36,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:36,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:36,251 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 76 states. [2020-07-28 14:32:36,251 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 76 states. [2020-07-28 14:32:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:32:36,254 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2020-07-28 14:32:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2020-07-28 14:32:36,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:32:36,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:32:36,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:32:36,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:32:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-28 14:32:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2020-07-28 14:32:36,258 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2020-07-28 14:32:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:32:36,258 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-07-28 14:32:36,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 14:32:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2020-07-28 14:32:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:32:36,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:32:36,259 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:32:36,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:32:36,475 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:32:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:32:36,476 INFO L82 PathProgramCache]: Analyzing trace with hash -415449258, now seen corresponding path program 1 times [2020-07-28 14:32:36,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:32:36,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653827479] [2020-07-28 14:32:36,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:32:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:32:36,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:32:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:32:36,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:32:36,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:32:36,557 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:32:36,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 14:32:36,610 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:32:36,611 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:32:36,611 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 14:32:36,611 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 14:32:36,611 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 14:32:36,612 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 14:32:36,612 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 14:32:36,612 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 14:32:36,612 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-28 14:32:36,612 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-28 14:32:36,612 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-28 14:32:36,613 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 14:32:36,613 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 14:32:36,613 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 14:32:36,613 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:32:36,613 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 14:32:36,614 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:32:36,614 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:32:36,614 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:32:36,614 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:32:36,615 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 14:32:36,615 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 14:32:36,615 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:32:36,615 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:32:36,615 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:32:36,616 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 14:32:36,616 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:32:36,616 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:32:36,616 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 14:32:36,617 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 14:32:36,617 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:32:36,617 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:32:36,617 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-28 14:32:36,618 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:32:36,618 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-28 14:32:36,618 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:32:36,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:32:36 BoogieIcfgContainer [2020-07-28 14:32:36,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:32:36,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:32:36,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:32:36,623 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:32:36,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:32:31" (3/4) ... [2020-07-28 14:32:36,627 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:32:36,697 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:32:36,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:32:36,700 INFO L168 Benchmark]: Toolchain (without parser) took 6516.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 952.2 MB in the beginning and 931.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. [2020-07-28 14:32:36,701 INFO L168 Benchmark]: CDTParser took 0.94 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:32:36,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 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:32:36,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:32:36,703 INFO L168 Benchmark]: Boogie Preprocessor took 33.31 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:32:36,704 INFO L168 Benchmark]: RCFGBuilder took 499.29 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2020-07-28 14:32:36,705 INFO L168 Benchmark]: TraceAbstraction took 5408.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 939.2 MB in the end (delta: 163.0 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. [2020-07-28 14:32:36,705 INFO L168 Benchmark]: Witness Printer took 75.47 ms. Allocated memory is still 1.2 GB. Free memory was 939.2 MB in the beginning and 931.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2020-07-28 14:32:36,709 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.94 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 372.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 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 117.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.31 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 499.29 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5408.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 939.2 MB in the end (delta: 163.0 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. * Witness Printer took 75.47 ms. Allocated memory is still 1.2 GB. Free memory was 939.2 MB in the beginning and 931.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int SIZE; [L12] const int MAX = 100000; VAL [MAX=100000, SIZE=0] [L16] SIZE = __VERIFIER_nondet_int() [L17] COND TRUE SIZE > 1 && SIZE < MAX [L19] int i; [L20] int *a = malloc(sizeof(int)*SIZE); [L22] i = 0 VAL [MAX=100000, SIZE=2] [L22] COND TRUE i < SIZE [L24] a[i] = __VERIFIER_nondet_int() [L22] i++ VAL [MAX=100000, SIZE=2] [L22] COND TRUE i < SIZE [L24] a[i] = __VERIFIER_nondet_int() [L22] i++ VAL [MAX=100000, SIZE=2] [L22] COND FALSE !(i < SIZE) VAL [MAX=100000, SIZE=2] [L27] COND FALSE !(SIZE % 2 != 0) [L4] COND FALSE !(!cond) VAL [MAX=100000, SIZE=2] [L30] i = 1 VAL [MAX=100000, SIZE=2] [L30] COND TRUE i <= SIZE/2 [L32] EXPR a[2*i-2] VAL [MAX=100000, SIZE=2] [L32] COND FALSE !(a[2*i-2] > i) [L36] EXPR a[2*i-1] VAL [MAX=100000, SIZE=2] [L36] COND TRUE a[2*i-1] > i [L38] a[2*i-1] = 2*i-1 VAL [MAX=100000, SIZE=2] [L30] i++ VAL [MAX=100000, SIZE=2] [L30] COND FALSE !(i <= SIZE/2) VAL [MAX=100000, SIZE=2] [L42] i = 0 VAL [MAX=100000, SIZE=2] [L42] COND TRUE i < SIZE [L44] a[i] [L6] COND TRUE !(cond) VAL [MAX=100000, SIZE=2] [L6] __VERIFIER_error() VAL [MAX=100000, SIZE=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 105 SDtfs, 188 SDslu, 124 SDs, 0 SdLazy, 284 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 37 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 7768 SizeOfPredicates, 10 NumberOfNonLiveVariables, 139 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 12/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...