./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1iff.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s1iff.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 95ae5d1d1dd8cd24ee76172d1c8b94f0baa09c26 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:35,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:54:35,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:54:35,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:54:35,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:54:35,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:54:35,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:54:35,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:54:35,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:54:35,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:54:35,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:54:35,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:54:35,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:54:35,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:54:35,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:54:35,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:54:35,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:54:35,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:54:35,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:54:35,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:54:35,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:54:35,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:54:35,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:54:35,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:54:35,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:54:35,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:54:35,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:54:35,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:54:35,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:54:35,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:54:35,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:54:35,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:54:35,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:54:35,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:54:35,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:54:35,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:54:35,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:54:35,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:54:35,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:54:35,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:54:35,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:54:35,895 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:54:35,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:54:35,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:54:35,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:54:35,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:54:35,937 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:54:35,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:54:35,937 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:54:35,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:54:35,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:54:35,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:54:35,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:54:35,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:54:35,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:54:35,938 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:54:35,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:54:35,939 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:54:35,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:54:35,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:54:35,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:54:35,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:54:35,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:54:35,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:54:35,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:54:35,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:54:35,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:54:35,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:54:35,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:54:35,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:54:35,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:54:35,946 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 -> 95ae5d1d1dd8cd24ee76172d1c8b94f0baa09c26 [2020-07-28 14:54:36,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:54:36,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:54:36,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:54:36,263 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:54:36,264 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:54:36,265 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1iff.c [2020-07-28 14:54:36,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a96b45d/a7e943d40e4c4523a9e710f8d3cfc56d/FLAGe1b428b82 [2020-07-28 14:54:36,793 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:54:36,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1iff.c [2020-07-28 14:54:36,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a96b45d/a7e943d40e4c4523a9e710f8d3cfc56d/FLAGe1b428b82 [2020-07-28 14:54:37,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a96b45d/a7e943d40e4c4523a9e710f8d3cfc56d [2020-07-28 14:54:37,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:54:37,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:54:37,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:54:37,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:54:37,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:54:37,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b955d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37, skipping insertion in model container [2020-07-28 14:54:37,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:54:37,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:54:37,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:54:37,415 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:54:37,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:54:37,456 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:54:37,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37 WrapperNode [2020-07-28 14:54:37,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:54:37,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:54:37,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:54:37,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:54:37,467 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:54:37" (1/1) ... [2020-07-28 14:54:37,535 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:54:37" (1/1) ... [2020-07-28 14:54:37,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:54:37,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:54:37,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:54:37,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:54:37,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (1/1) ... [2020-07-28 14:54:37,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:54:37,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:54:37,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:54:37,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:54:37,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (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:54:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:54:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:54:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:54:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:54:37,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:54:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:54:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:54:38,027 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:54:38,028 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-28 14:54:38,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:54:38 BoogieIcfgContainer [2020-07-28 14:54:38,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:54:38,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:54:38,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:54:38,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:54:38,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:54:37" (1/3) ... [2020-07-28 14:54:38,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86802e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:54:38, skipping insertion in model container [2020-07-28 14:54:38,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:37" (2/3) ... [2020-07-28 14:54:38,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86802e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:54:38, skipping insertion in model container [2020-07-28 14:54:38,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:54:38" (3/3) ... [2020-07-28 14:54:38,042 INFO L109 eAbstractionObserver]: Analyzing ICFG s1iff.c [2020-07-28 14:54:38,053 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:54:38,061 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:54:38,072 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:54:38,092 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:54:38,093 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:54:38,093 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:54:38,093 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:54:38,093 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:54:38,094 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:54:38,094 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:54:38,094 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:54:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 14:54:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:54:38,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:38,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:38,118 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2020-07-28 14:54:38,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:38,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050499690] [2020-07-28 14:54:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:38,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {22#true} is VALID [2020-07-28 14:54:38,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 14:54:38,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {22#true} is VALID [2020-07-28 14:54:38,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {22#true} assume 0 == assume_abort_if_not_~cond;assume false; {23#false} is VALID [2020-07-28 14:54:38,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {23#false} is VALID [2020-07-28 14:54:38,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} assume !(main_~i~0 < ~N~0); {23#false} is VALID [2020-07-28 14:54:38,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} main_~i~0 := 0; {23#false} is VALID [2020-07-28 14:54:38,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !(main_~i~0 < ~N~0); {23#false} is VALID [2020-07-28 14:54:38,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 14:54:38,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 14:54:38,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 14:54:38,288 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:54:38,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050499690] [2020-07-28 14:54:38,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:54:38,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:54:38,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159118561] [2020-07-28 14:54:38,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:54:38,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:38,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:54:38,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:38,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:54:38,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:38,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:54:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:54:38,343 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 14:54:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:38,397 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-07-28 14:54:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:54:38,398 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:54:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:54:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2020-07-28 14:54:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:54:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2020-07-28 14:54:38,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2020-07-28 14:54:38,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:38,503 INFO L225 Difference]: With dead ends: 34 [2020-07-28 14:54:38,503 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 14:54:38,507 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:54:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 14:54:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-28 14:54:38,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:38,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-28 14:54:38,546 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 14:54:38,546 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 14:54:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:38,549 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 14:54:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 14:54:38,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:38,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:38,551 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 14:54:38,551 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 14:54:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:38,554 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 14:54:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 14:54:38,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:38,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:38,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:38,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 14:54:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-28 14:54:38,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2020-07-28 14:54:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:38,561 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-28 14:54:38,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:54:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 14:54:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:54:38,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:38,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:38,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:54:38,563 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2020-07-28 14:54:38,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:38,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140222325] [2020-07-28 14:54:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:38,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {113#true} is VALID [2020-07-28 14:54:38,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {113#true} is VALID [2020-07-28 14:54:38,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {113#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {115#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:38,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {115#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {115#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:38,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {115#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {116#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:38,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {116#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {114#false} is VALID [2020-07-28 14:54:38,674 INFO L280 TraceCheckUtils]: 6: Hoare triple {114#false} main_~i~0 := 0; {114#false} is VALID [2020-07-28 14:54:38,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {114#false} assume !(main_~i~0 < ~N~0); {114#false} is VALID [2020-07-28 14:54:38,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {114#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {114#false} is VALID [2020-07-28 14:54:38,675 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume 0 == __VERIFIER_assert_~cond; {114#false} is VALID [2020-07-28 14:54:38,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-28 14:54:38,676 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:54:38,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140222325] [2020-07-28 14:54:38,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:54:38,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:54:38,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741367209] [2020-07-28 14:54:38,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 14:54:38,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:38,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:54:38,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:38,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:54:38,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:54:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:54:38,700 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2020-07-28 14:54:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:38,816 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-28 14:54:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:54:38,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 14:54:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:54:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-28 14:54:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:54:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-28 14:54:38,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-28 14:54:38,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:38,883 INFO L225 Difference]: With dead ends: 28 [2020-07-28 14:54:38,883 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 14:54:38,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:54:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 14:54:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-07-28 14:54:38,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:38,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 17 states. [2020-07-28 14:54:38,895 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 17 states. [2020-07-28 14:54:38,896 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 17 states. [2020-07-28 14:54:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:38,898 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 14:54:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-28 14:54:38,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:38,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:38,899 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states. [2020-07-28 14:54:38,900 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states. [2020-07-28 14:54:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:38,902 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 14:54:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-28 14:54:38,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:38,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:38,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:38,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 14:54:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-28 14:54:38,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2020-07-28 14:54:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:38,907 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-28 14:54:38,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:54:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 14:54:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 14:54:38,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:38,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:38,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:54:38,910 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2020-07-28 14:54:38,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:38,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789117337] [2020-07-28 14:54:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:39,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {213#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {213#true} is VALID [2020-07-28 14:54:39,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {213#true} is VALID [2020-07-28 14:54:39,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {213#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {215#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:39,328 INFO L280 TraceCheckUtils]: 3: Hoare triple {215#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {215#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:39,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {215#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {216#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:39,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {216#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {216#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:39,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {216#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {217#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:54:39,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < ~N~0); {218#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (<= ~N~0 1) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:39,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (<= ~N~0 1) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} main_~i~0 := 0; {218#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (<= ~N~0 1) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:39,341 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (<= ~N~0 1) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {219#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (or (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (* 2 ~N~0)) (not (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (or (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))) |ULTIMATE.start_main_#t~mem4|)))} is VALID [2020-07-28 14:54:39,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {219#(and (not (= |ULTIMATE.start_main_~#sum~0.base| ULTIMATE.start_main_~a~0.base)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (or (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (* 2 ~N~0)) (not (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (or (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))) |ULTIMATE.start_main_#t~mem4|)))} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {220#(= (* 2 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))} is VALID [2020-07-28 14:54:39,345 INFO L280 TraceCheckUtils]: 11: Hoare triple {220#(= (* 2 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {220#(= (* 2 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))} is VALID [2020-07-28 14:54:39,346 INFO L280 TraceCheckUtils]: 12: Hoare triple {220#(= (* 2 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))} assume !(main_~i~0 < ~N~0); {220#(= (* 2 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))} is VALID [2020-07-28 14:54:39,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {220#(= (* 2 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|))} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {221#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 14:54:39,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {221#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {214#false} is VALID [2020-07-28 14:54:39,349 INFO L280 TraceCheckUtils]: 15: Hoare triple {214#false} assume !false; {214#false} is VALID [2020-07-28 14:54:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:54:39,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789117337] [2020-07-28 14:54:39,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702638132] [2020-07-28 14:54:39,357 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:54:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:39,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-28 14:54:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:39,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:54:39,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-28 14:54:39,620 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:54:39,630 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:54:39,631 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:54:39,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-28 14:54:39,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:54:39,703 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-28 14:54:39,704 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:54:39,718 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:54:39,719 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:54:39,719 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-28 14:54:40,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:54:40,473 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:54:40,474 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2020-07-28 14:54:40,481 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:54:40,527 INFO L624 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2020-07-28 14:54:40,576 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-28 14:54:40,576 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:48 [2020-07-28 14:54:40,585 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:54:40,585 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_~i~0, v_ULTIMATE.start_main_~i~0_16]. (let ((.cse3 (select |v_#memory_int_13| ULTIMATE.start_main_~a~0.base)) (.cse2 (select |v_#memory_int_13| |ULTIMATE.start_main_~#sum~0.base|))) (let ((.cse1 (select .cse2 |ULTIMATE.start_main_~#sum~0.offset|)) (.cse0 (select .cse3 (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))))) (and (= 1 .cse0) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= 1 ~N~0) (= 1 .cse1) (= (store |v_#memory_int_13| |ULTIMATE.start_main_~#sum~0.base| (store .cse2 |ULTIMATE.start_main_~#sum~0.offset| (+ .cse1 .cse0))) |#memory_int|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select .cse3 (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset)))))) [2020-07-28 14:54:40,586 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~a~0.base, v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_~i~0]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (and (= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (- 1))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= 1 ~N~0) (= 1 (select .cse0 (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select .cse0 (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) [2020-07-28 14:54:41,248 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:54:41,558 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:54:41,875 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:54:42,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {213#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {213#true} is VALID [2020-07-28 14:54:42,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {213#true} is VALID [2020-07-28 14:54:42,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {213#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {215#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:42,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {215#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {215#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:42,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {215#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {237#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ULTIMATE.start_main_~i~0 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:42,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ULTIMATE.start_main_~i~0 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {241#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ULTIMATE.start_main_~i~0 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))} is VALID [2020-07-28 14:54:42,371 INFO L280 TraceCheckUtils]: 6: Hoare triple {241#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ULTIMATE.start_main_~i~0 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {245#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:42,373 INFO L280 TraceCheckUtils]: 7: Hoare triple {245#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {249#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))))} is VALID [2020-07-28 14:54:42,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))))} main_~i~0 := 0; {249#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))))} is VALID [2020-07-28 14:54:42,376 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {256#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))) |ULTIMATE.start_main_#t~mem4|))} is VALID [2020-07-28 14:54:42,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(and (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0) (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))) |ULTIMATE.start_main_#t~mem4|))} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {260#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (exists ((v_ULTIMATE.start_main_~i~0_16 Int) (ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (ULTIMATE.start_main_~i~0 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:42,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {260#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (exists ((v_ULTIMATE.start_main_~i~0_16 Int) (ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (ULTIMATE.start_main_~i~0 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (<= 1 ~N~0))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {260#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (exists ((v_ULTIMATE.start_main_~i~0_16 Int) (ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (ULTIMATE.start_main_~i~0 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:42,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {260#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (exists ((v_ULTIMATE.start_main_~i~0_16 Int) (ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (ULTIMATE.start_main_~i~0 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {260#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (exists ((v_ULTIMATE.start_main_~i~0_16 Int) (ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (ULTIMATE.start_main_~i~0 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:42,407 INFO L280 TraceCheckUtils]: 13: Hoare triple {260#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (exists ((v_ULTIMATE.start_main_~i~0_16 Int) (ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int) (ULTIMATE.start_main_~i~0 Int)) (and (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (<= 1 ~N~0))} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {270#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:54:42,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {270#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {214#false} is VALID [2020-07-28 14:54:42,412 INFO L280 TraceCheckUtils]: 15: Hoare triple {214#false} assume !false; {214#false} is VALID [2020-07-28 14:54:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:54:42,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:54:42,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-07-28 14:54:42,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978976311] [2020-07-28 14:54:42,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2020-07-28 14:54:42,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:42,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-28 14:54:42,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:42,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-28 14:54:42,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:42,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-28 14:54:42,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-28 14:54:42,652 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-28 14:54:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:43,983 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-28 14:54:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 14:54:43,983 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2020-07-28 14:54:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:54:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2020-07-28 14:54:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:54:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2020-07-28 14:54:43,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2020-07-28 14:54:50,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:50,218 INFO L225 Difference]: With dead ends: 35 [2020-07-28 14:54:50,218 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 14:54:50,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2020-07-28 14:54:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 14:54:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-07-28 14:54:50,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:50,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2020-07-28 14:54:50,247 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2020-07-28 14:54:50,248 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2020-07-28 14:54:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:50,250 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-28 14:54:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-28 14:54:50,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:50,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:50,251 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2020-07-28 14:54:50,251 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2020-07-28 14:54:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:50,253 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-28 14:54:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-28 14:54:50,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:50,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:50,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:50,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 14:54:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-28 14:54:50,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2020-07-28 14:54:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:50,257 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-28 14:54:50,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-28 14:54:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-28 14:54:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 14:54:50,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:50,258 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:50,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:54:50,471 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2020-07-28 14:54:50,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:50,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174553601] [2020-07-28 14:54:50,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:50,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {412#true} is VALID [2020-07-28 14:54:50,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {412#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {412#true} is VALID [2020-07-28 14:54:50,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {412#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {412#true} is VALID [2020-07-28 14:54:50,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {412#true} assume !(0 == assume_abort_if_not_~cond); {412#true} is VALID [2020-07-28 14:54:50,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {412#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {414#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:50,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {414#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {414#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:50,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {414#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {415#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:50,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {415#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {416#(<= 2 ~N~0)} is VALID [2020-07-28 14:54:50,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {416#(<= 2 ~N~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {416#(<= 2 ~N~0)} is VALID [2020-07-28 14:54:50,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {416#(<= 2 ~N~0)} assume !(main_~i~0 < ~N~0); {416#(<= 2 ~N~0)} is VALID [2020-07-28 14:54:50,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {416#(<= 2 ~N~0)} main_~i~0 := 0; {417#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} is VALID [2020-07-28 14:54:50,584 INFO L280 TraceCheckUtils]: 11: Hoare triple {417#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {417#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} is VALID [2020-07-28 14:54:50,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {417#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {417#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} is VALID [2020-07-28 14:54:50,586 INFO L280 TraceCheckUtils]: 13: Hoare triple {417#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {418#(<= (+ ULTIMATE.start_main_~i~0 1) ~N~0)} is VALID [2020-07-28 14:54:50,587 INFO L280 TraceCheckUtils]: 14: Hoare triple {418#(<= (+ ULTIMATE.start_main_~i~0 1) ~N~0)} assume !(main_~i~0 < ~N~0); {413#false} is VALID [2020-07-28 14:54:50,587 INFO L280 TraceCheckUtils]: 15: Hoare triple {413#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {413#false} is VALID [2020-07-28 14:54:50,587 INFO L280 TraceCheckUtils]: 16: Hoare triple {413#false} assume 0 == __VERIFIER_assert_~cond; {413#false} is VALID [2020-07-28 14:54:50,588 INFO L280 TraceCheckUtils]: 17: Hoare triple {413#false} assume !false; {413#false} is VALID [2020-07-28 14:54:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:54:50,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174553601] [2020-07-28 14:54:50,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934354686] [2020-07-28 14:54:50,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:54:50,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:54:50,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:54:50,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:54:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:50,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:54:50,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {412#true} is VALID [2020-07-28 14:54:50,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {412#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {412#true} is VALID [2020-07-28 14:54:50,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {412#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {412#true} is VALID [2020-07-28 14:54:50,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {412#true} assume !(0 == assume_abort_if_not_~cond); {412#true} is VALID [2020-07-28 14:54:50,810 INFO L280 TraceCheckUtils]: 4: Hoare triple {412#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {434#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:50,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#(<= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {434#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:50,811 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#(<= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {415#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:50,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {415#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {416#(<= 2 ~N~0)} is VALID [2020-07-28 14:54:50,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {416#(<= 2 ~N~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {416#(<= 2 ~N~0)} is VALID [2020-07-28 14:54:50,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {416#(<= 2 ~N~0)} assume !(main_~i~0 < ~N~0); {416#(<= 2 ~N~0)} is VALID [2020-07-28 14:54:50,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {416#(<= 2 ~N~0)} main_~i~0 := 0; {453#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:54:50,815 INFO L280 TraceCheckUtils]: 11: Hoare triple {453#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {453#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:54:50,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {453#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {453#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:54:50,818 INFO L280 TraceCheckUtils]: 13: Hoare triple {453#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {463#(and (<= 2 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:54:50,819 INFO L280 TraceCheckUtils]: 14: Hoare triple {463#(and (<= 2 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < ~N~0); {413#false} is VALID [2020-07-28 14:54:50,819 INFO L280 TraceCheckUtils]: 15: Hoare triple {413#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {413#false} is VALID [2020-07-28 14:54:50,819 INFO L280 TraceCheckUtils]: 16: Hoare triple {413#false} assume 0 == __VERIFIER_assert_~cond; {413#false} is VALID [2020-07-28 14:54:50,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {413#false} assume !false; {413#false} is VALID [2020-07-28 14:54:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:54:50,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:54:50,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:54:50,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389814956] [2020-07-28 14:54:50,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:54:50,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:50,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:54:50,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:50,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:54:50,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:50,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:54:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:54:50,863 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2020-07-28 14:54:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:51,296 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-28 14:54:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 14:54:51,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:54:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:54:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-28 14:54:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:54:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-28 14:54:51,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2020-07-28 14:54:51,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:51,357 INFO L225 Difference]: With dead ends: 33 [2020-07-28 14:54:51,357 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 14:54:51,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-07-28 14:54:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 14:54:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-07-28 14:54:51,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:51,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2020-07-28 14:54:51,396 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2020-07-28 14:54:51,396 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2020-07-28 14:54:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:51,401 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 14:54:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 14:54:51,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:51,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:51,402 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2020-07-28 14:54:51,402 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2020-07-28 14:54:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:51,404 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 14:54:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 14:54:51,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:51,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:51,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:51,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 14:54:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-28 14:54:51,406 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2020-07-28 14:54:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:51,406 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-28 14:54:51,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:54:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:54:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:54:51,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:51,408 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:51,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:54:51,621 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2020-07-28 14:54:51,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:51,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149208721] [2020-07-28 14:54:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:51,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {614#true} is VALID [2020-07-28 14:54:51,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {614#true} is VALID [2020-07-28 14:54:51,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {614#true} is VALID [2020-07-28 14:54:51,708 INFO L280 TraceCheckUtils]: 3: Hoare triple {614#true} assume !(0 == assume_abort_if_not_~cond); {614#true} is VALID [2020-07-28 14:54:51,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {614#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {616#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:51,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {616#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:51,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {616#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {617#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:54:51,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {618#(<= ~N~0 1)} is VALID [2020-07-28 14:54:51,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(<= ~N~0 1)} main_~i~0 := 0; {619#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {619#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {619#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {619#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {619#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {619#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {620#(<= ~N~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:54:51,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {620#(<= ~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {615#false} is VALID [2020-07-28 14:54:51,718 INFO L280 TraceCheckUtils]: 13: Hoare triple {615#false} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {615#false} is VALID [2020-07-28 14:54:51,718 INFO L280 TraceCheckUtils]: 14: Hoare triple {615#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {615#false} is VALID [2020-07-28 14:54:51,719 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#false} assume !(main_~i~0 < ~N~0); {615#false} is VALID [2020-07-28 14:54:51,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {615#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {615#false} is VALID [2020-07-28 14:54:51,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {615#false} assume 0 == __VERIFIER_assert_~cond; {615#false} is VALID [2020-07-28 14:54:51,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {615#false} assume !false; {615#false} is VALID [2020-07-28 14:54:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:54:51,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149208721] [2020-07-28 14:54:51,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719558052] [2020-07-28 14:54:51,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:54:51,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 14:54:51,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:54:51,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:54:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:51,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:54:51,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {614#true} is VALID [2020-07-28 14:54:51,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~post3, main_#t~mem9, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {614#true} is VALID [2020-07-28 14:54:51,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {614#true} is VALID [2020-07-28 14:54:51,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {614#true} assume !(0 == assume_abort_if_not_~cond); {614#true} is VALID [2020-07-28 14:54:51,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {614#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {636#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:54:51,933 INFO L280 TraceCheckUtils]: 5: Hoare triple {636#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < ~N~0);call write~int(1, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {636#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:54:51,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {636#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {617#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:54:51,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {618#(<= ~N~0 1)} is VALID [2020-07-28 14:54:51,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(<= ~N~0 1)} main_~i~0 := 0; {649#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {649#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {649#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,937 INFO L280 TraceCheckUtils]: 10: Hoare triple {649#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {649#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,938 INFO L280 TraceCheckUtils]: 11: Hoare triple {649#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {659#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:54:51,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {659#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {615#false} is VALID [2020-07-28 14:54:51,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {615#false} assume 1 == main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5 + main_#t~mem6, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem5;havoc main_#t~mem6; {615#false} is VALID [2020-07-28 14:54:51,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {615#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {615#false} is VALID [2020-07-28 14:54:51,940 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#false} assume !(main_~i~0 < ~N~0); {615#false} is VALID [2020-07-28 14:54:51,941 INFO L280 TraceCheckUtils]: 16: Hoare triple {615#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {615#false} is VALID [2020-07-28 14:54:51,941 INFO L280 TraceCheckUtils]: 17: Hoare triple {615#false} assume 0 == __VERIFIER_assert_~cond; {615#false} is VALID [2020-07-28 14:54:51,941 INFO L280 TraceCheckUtils]: 18: Hoare triple {615#false} assume !false; {615#false} is VALID [2020-07-28 14:54:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:54:51,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:54:51,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:54:51,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909600647] [2020-07-28 14:54:51,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-28 14:54:51,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:51,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:54:51,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:51,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:54:51,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:51,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:54:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:54:51,978 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2020-07-28 14:54:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:52,279 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-28 14:54:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 14:54:52,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-28 14:54:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:54:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-28 14:54:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:54:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-28 14:54:52,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2020-07-28 14:54:52,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:52,340 INFO L225 Difference]: With dead ends: 37 [2020-07-28 14:54:52,340 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 14:54:52,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-28 14:54:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 14:54:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-07-28 14:54:52,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:52,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2020-07-28 14:54:52,367 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2020-07-28 14:54:52,368 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2020-07-28 14:54:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:52,369 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:54:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:54:52,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:52,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:52,370 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2020-07-28 14:54:52,370 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2020-07-28 14:54:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:52,372 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:54:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:54:52,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:52,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:52,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:52,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:54:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-07-28 14:54:52,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2020-07-28 14:54:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:52,374 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-28 14:54:52,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:54:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-28 14:54:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:54:52,375 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:52,375 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:52,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:54:52,586 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2020-07-28 14:54:52,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:52,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024895254] [2020-07-28 14:54:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:54:52,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:54:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:54:52,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:54:52,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:54:52,699 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:54:52,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 14:54:52,752 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:54:52,753 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:54:52,754 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:54:52,755 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:54:52,755 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:54:52,755 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 14:54:52,755 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:54:52,755 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:54:52,755 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:54:52,757 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:54:52,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:54:52 BoogieIcfgContainer [2020-07-28 14:54:52,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:54:52,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:54:52,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:54:52,760 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:54:52,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:54:38" (3/4) ... [2020-07-28 14:54:52,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:54:52,836 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:54:52,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:54:52,840 INFO L168 Benchmark]: Toolchain (without parser) took 15681.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 950.8 MB in the beginning and 961.1 MB in the end (delta: -10.2 MB). Peak memory consumption was 293.9 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:52,840 INFO L168 Benchmark]: CDTParser took 0.28 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:54:52,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.82 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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:54:52,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:52,847 INFO L168 Benchmark]: Boogie Preprocessor took 29.30 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:54:52,847 INFO L168 Benchmark]: RCFGBuilder took 441.03 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:52,848 INFO L168 Benchmark]: TraceAbstraction took 14726.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 961.1 MB in the end (delta: 140.1 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:52,848 INFO L168 Benchmark]: Witness Printer took 77.08 ms. Allocated memory is still 1.3 GB. Free memory is still 961.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:54:52,854 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.28 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 295.82 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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 103.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.30 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 441.03 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14726.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 961.1 MB in the end (delta: 140.1 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.08 ms. Allocated memory is still 1.3 GB. Free memory is still 961.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L11] COND FALSE !(!cond) VAL [N=2] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [N=2] [L30] COND TRUE i