./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s2iff.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/s2iff.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 7b879d400a9ead235772d3ee2fd12110abf977a3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:55:01,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:55:01,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:55:01,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:55:01,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:55:01,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:55:01,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:55:01,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:55:01,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:55:01,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:55:01,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:55:01,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:55:01,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:55:01,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:55:01,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:55:01,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:55:01,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:55:01,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:55:01,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:55:01,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:55:01,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:55:01,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:55:01,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:55:01,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:55:01,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:55:01,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:55:01,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:55:01,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:55:01,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:55:01,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:55:01,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:55:01,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:55:01,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:55:01,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:55:01,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:55:01,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:55:01,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:55:01,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:55:01,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:55:01,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:55:01,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:55:01,919 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:55:01,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:55:01,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:55:01,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:55:01,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:55:01,941 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:55:01,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:55:01,941 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:55:01,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:55:01,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:55:01,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:55:01,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:55:01,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:55:01,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:55:01,943 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:55:01,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:55:01,944 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:55:01,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:55:01,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:55:01,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:55:01,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:55:01,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:55:01,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:55:01,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:55:01,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:55:01,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:55:01,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:55:01,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:55:01,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:55:01,947 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:55:01,948 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 -> 7b879d400a9ead235772d3ee2fd12110abf977a3 [2020-07-28 14:55:02,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:55:02,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:55:02,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:55:02,273 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:55:02,273 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:55:02,274 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s2iff.c [2020-07-28 14:55:02,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882c14ac3/d694ac81b3494cd08687a14d8c264dbd/FLAG2c404a707 [2020-07-28 14:55:02,721 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:55:02,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s2iff.c [2020-07-28 14:55:02,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882c14ac3/d694ac81b3494cd08687a14d8c264dbd/FLAG2c404a707 [2020-07-28 14:55:03,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882c14ac3/d694ac81b3494cd08687a14d8c264dbd [2020-07-28 14:55:03,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:55:03,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:55:03,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:55:03,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:55:03,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:55:03,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77aa84ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03, skipping insertion in model container [2020-07-28 14:55:03,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:55:03,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:55:03,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:55:03,406 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:55:03,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:55:03,450 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:55:03,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03 WrapperNode [2020-07-28 14:55:03,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:55:03,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:55:03,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:55:03,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:55:03,516 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:55:03" (1/1) ... [2020-07-28 14:55:03,528 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:55:03" (1/1) ... [2020-07-28 14:55:03,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:55:03,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:55:03,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:55:03,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:55:03,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (1/1) ... [2020-07-28 14:55:03,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:55:03,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:55:03,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:55:03,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:55:03,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (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:55:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:55:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:55:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:55:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:55:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:55:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:55:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:55:04,064 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:55:04,064 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-28 14:55:04,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:55:04 BoogieIcfgContainer [2020-07-28 14:55:04,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:55:04,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:55:04,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:55:04,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:55:04,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:55:03" (1/3) ... [2020-07-28 14:55:04,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2563998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:55:04, skipping insertion in model container [2020-07-28 14:55:04,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:03" (2/3) ... [2020-07-28 14:55:04,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2563998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:55:04, skipping insertion in model container [2020-07-28 14:55:04,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:55:04" (3/3) ... [2020-07-28 14:55:04,079 INFO L109 eAbstractionObserver]: Analyzing ICFG s2iff.c [2020-07-28 14:55:04,088 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:55:04,095 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:55:04,110 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:55:04,134 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:55:04,135 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:55:04,135 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:55:04,135 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:55:04,136 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:55:04,136 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:55:04,136 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:55:04,136 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:55:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 14:55:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:55:04,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:04,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:55:04,162 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2020-07-28 14:55:04,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:04,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173753894] [2020-07-28 14:55:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:04,343 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:55:04,344 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:55:04,345 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:55:04,346 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:55:04,347 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:55:04,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} assume !(main_~i~0 < ~N~0); {23#false} is VALID [2020-07-28 14:55:04,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} main_~i~0 := 0; {23#false} is VALID [2020-07-28 14:55:04,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !(main_~i~0 < ~N~0); {23#false} is VALID [2020-07-28 14:55:04,348 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 == 3 * ~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:55:04,349 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 14:55:04,349 INFO L280 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 14:55:04,352 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:55:04,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173753894] [2020-07-28 14:55:04,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:55:04,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:55:04,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909338230] [2020-07-28 14:55:04,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:55:04,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:04,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:55:04,395 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:55:04,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:55:04,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:55:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:55:04,409 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 14:55:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:04,472 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-07-28 14:55:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:55:04,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:55:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:55:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2020-07-28 14:55:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:55:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2020-07-28 14:55:04,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2020-07-28 14:55:04,605 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:55:04,616 INFO L225 Difference]: With dead ends: 34 [2020-07-28 14:55:04,617 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 14:55:04,621 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:55:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 14:55:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-28 14:55:04,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:04,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-28 14:55:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 14:55:04,658 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 14:55:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:04,661 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 14:55:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 14:55:04,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:04,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:04,663 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 14:55:04,663 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 14:55:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:04,665 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 14:55:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 14:55:04,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:04,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:04,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:04,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 14:55:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-28 14:55:04,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2020-07-28 14:55:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:04,672 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-28 14:55:04,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:55:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 14:55:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:55:04,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:04,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:55:04,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:55:04,674 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2020-07-28 14:55:04,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:04,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614956862] [2020-07-28 14:55:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:04,776 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:55:04,777 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:55:04,778 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:55:04,779 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:55:04,781 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:55:04,783 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:55:04,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {114#false} main_~i~0 := 0; {114#false} is VALID [2020-07-28 14:55:04,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {114#false} assume !(main_~i~0 < ~N~0); {114#false} is VALID [2020-07-28 14:55:04,784 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 == 3 * ~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:55:04,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume 0 == __VERIFIER_assert_~cond; {114#false} is VALID [2020-07-28 14:55:04,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-28 14:55:04,786 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:55:04,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614956862] [2020-07-28 14:55:04,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:55:04,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:55:04,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49515920] [2020-07-28 14:55:04,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 14:55:04,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:04,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:55:04,808 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:55:04,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:55:04,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:55:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:55:04,809 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2020-07-28 14:55:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:04,928 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-28 14:55:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:55:04,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 14:55:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:55:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-28 14:55:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:55:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-28 14:55:04,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-28 14:55:04,995 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:55:04,997 INFO L225 Difference]: With dead ends: 28 [2020-07-28 14:55:04,997 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 14:55:04,998 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:55:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 14:55:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-07-28 14:55:05,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:05,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 17 states. [2020-07-28 14:55:05,011 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 17 states. [2020-07-28 14:55:05,011 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 17 states. [2020-07-28 14:55:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:05,013 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 14:55:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-28 14:55:05,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:05,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:05,014 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states. [2020-07-28 14:55:05,015 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states. [2020-07-28 14:55:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:05,017 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 14:55:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-28 14:55:05,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:05,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:05,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:05,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 14:55:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-28 14:55:05,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2020-07-28 14:55:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:05,022 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-28 14:55:05,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:55:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 14:55:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 14:55:05,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:05,023 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:55:05,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:55:05,024 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2020-07-28 14:55:05,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:05,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098138914] [2020-07-28 14:55:05,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:05,476 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:55:05,477 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:55:05,478 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:55:05,478 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:55:05,480 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:55:05,482 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(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {217#(and (= 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:55:05,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {217#(and (= 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; {218#(and (= 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:55:05,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {218#(and (= 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); {219#(and (<= ~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:55:05,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#(and (<= ~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; {219#(and (<= ~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:55:05,488 INFO L280 TraceCheckUtils]: 9: Hoare triple {219#(and (<= ~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); {220#(and (or (= 2 (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|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (or (and (<= ~N~0 1) (<= 1 ~N~0)) (not (= 2 (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:55:05,491 INFO L280 TraceCheckUtils]: 10: Hoare triple {220#(and (or (= 2 (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|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (or (and (<= ~N~0 1) (<= 1 ~N~0)) (not (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))))} assume 2 == 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; {221#(and (<= (* 3 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (* 3 ~N~0)))} is VALID [2020-07-28 14:55:05,492 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#(and (<= (* 3 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (* 3 ~N~0)))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {221#(and (<= (* 3 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (* 3 ~N~0)))} is VALID [2020-07-28 14:55:05,495 INFO L280 TraceCheckUtils]: 12: Hoare triple {221#(and (<= (* 3 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (* 3 ~N~0)))} assume !(main_~i~0 < ~N~0); {221#(and (<= (* 3 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (* 3 ~N~0)))} is VALID [2020-07-28 14:55:05,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {221#(and (<= (* 3 ~N~0) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|) (* 3 ~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 == 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {222#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 14:55:05,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {214#false} is VALID [2020-07-28 14:55:05,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {214#false} assume !false; {214#false} is VALID [2020-07-28 14:55:05,502 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:55:05,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098138914] [2020-07-28 14:55:05,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606520908] [2020-07-28 14:55:05,503 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:55:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:05,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-28 14:55:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:05,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:55:05,727 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:55:05,728 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:55:05,739 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:55:05,740 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:55:05,740 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-28 14:55:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:55:05,803 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:55:05,804 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:55:05,818 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:55:05,819 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:55:05,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-28 14:55:06,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 14:55:06,521 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:55:06,521 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:55:06,531 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:55:06,574 INFO L624 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2020-07-28 14:55:06,621 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:55:06,622 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:48 [2020-07-28 14:55:06,631 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 14:55:06,632 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 ((.cse0 (select |v_#memory_int_13| ULTIMATE.start_main_~a~0.base)) (.cse3 (select |v_#memory_int_13| |ULTIMATE.start_main_~#sum~0.base|))) (let ((.cse2 (select .cse3 |ULTIMATE.start_main_~#sum~0.offset|)) (.cse1 (select .cse0 (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4))))) (and (= 2 (select .cse0 (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (= 2 .cse1) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= 1 ~N~0) (= 1 .cse2) (= (store |v_#memory_int_13| |ULTIMATE.start_main_~#sum~0.base| (store .cse3 |ULTIMATE.start_main_~#sum~0.offset| (+ .cse2 .cse1))) |#memory_int|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1))))) [2020-07-28 14:55:06,632 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 (= 2 (select .cse0 (+ (* 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|) (- 2))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= 1 ~N~0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select .cse0 (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) [2020-07-28 14:55:07,230 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:55:07,482 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:55:07,756 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 14:55:08,151 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:55:08,151 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:55:08,152 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:55:08,153 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:55:08,157 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; {238#(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:55:08,161 INFO L280 TraceCheckUtils]: 5: Hoare triple {238#(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(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {242#(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) (= 2 (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:55:08,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#(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) (= 2 (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; {246#(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)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 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:55:08,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {246#(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)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 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); {250#(and (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (<= (+ 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))} is VALID [2020-07-28 14:55:08,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {250#(and (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (<= (+ 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))} main_~i~0 := 0; {250#(and (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (<= (+ 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))} is VALID [2020-07-28 14:55:08,172 INFO L280 TraceCheckUtils]: 9: Hoare triple {250#(and (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (<= (+ 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))} 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); {257#(and (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (<= (+ 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) (= (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:55:08,203 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#(and (exists ((v_ULTIMATE.start_main_~i~0_16 Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)))) (<= (+ 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) (= (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 2 == 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; {261#(and (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 (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (= 3 (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:55:08,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {261#(and (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 (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 1 ~N~0))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {261#(and (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 (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (= 3 (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:55:08,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {261#(and (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 (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (= 3 (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); {261#(and (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 (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (= 3 (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:55:08,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {261#(and (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 (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ (* v_ULTIMATE.start_main_~i~0_16 4) ULTIMATE.start_main_~a~0.offset))) (<= v_ULTIMATE.start_main_~i~0_16 0) (<= (+ ULTIMATE.start_main_~a~0.base 2) |ULTIMATE.start_main_~#sum~0.base|) (<= ~N~0 (+ v_ULTIMATE.start_main_~i~0_16 1)) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* ULTIMATE.start_main_~i~0 4)))))) (= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)) (<= 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 == 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {271#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 14:55:08,210 INFO L280 TraceCheckUtils]: 14: Hoare triple {271#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {214#false} is VALID [2020-07-28 14:55:08,210 INFO L280 TraceCheckUtils]: 15: Hoare triple {214#false} assume !false; {214#false} is VALID [2020-07-28 14:55:08,213 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:55:08,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:55:08,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-07-28 14:55:08,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239737661] [2020-07-28 14:55:08,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2020-07-28 14:55:08,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:08,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-28 14:55:08,889 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:55:08,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-28 14:55:08,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-28 14:55:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-28 14:55:08,890 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-28 14:55:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:10,321 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-28 14:55:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 14:55:10,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2020-07-28 14:55:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 14:55:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2020-07-28 14:55:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 14:55:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2020-07-28 14:55:10,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2020-07-28 14:55:15,647 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:55:15,648 INFO L225 Difference]: With dead ends: 35 [2020-07-28 14:55:15,648 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 14:55:15,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2020-07-28 14:55:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 14:55:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-07-28 14:55:15,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:15,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2020-07-28 14:55:15,673 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2020-07-28 14:55:15,673 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2020-07-28 14:55:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:15,677 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-28 14:55:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-28 14:55:15,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:15,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:15,677 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2020-07-28 14:55:15,678 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2020-07-28 14:55:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:15,680 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-28 14:55:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-28 14:55:15,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:15,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:15,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:15,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 14:55:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-28 14:55:15,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2020-07-28 14:55:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:15,683 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-28 14:55:15,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-28 14:55:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-28 14:55:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 14:55:15,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:15,685 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:55:15,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:55:15,897 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2020-07-28 14:55:15,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:15,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859212555] [2020-07-28 14:55:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:16,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {413#true} is VALID [2020-07-28 14:55:16,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {413#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; {413#true} is VALID [2020-07-28 14:55:16,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {413#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; {413#true} is VALID [2020-07-28 14:55:16,012 INFO L280 TraceCheckUtils]: 3: Hoare triple {413#true} assume !(0 == assume_abort_if_not_~cond); {413#true} is VALID [2020-07-28 14:55:16,013 INFO L280 TraceCheckUtils]: 4: Hoare triple {413#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; {415#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:16,014 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {415#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:16,014 INFO L280 TraceCheckUtils]: 6: Hoare triple {415#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {416#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:16,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {416#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {417#(<= 2 ~N~0)} is VALID [2020-07-28 14:55:16,017 INFO L280 TraceCheckUtils]: 8: Hoare triple {417#(<= 2 ~N~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {417#(<= 2 ~N~0)} is VALID [2020-07-28 14:55:16,018 INFO L280 TraceCheckUtils]: 9: Hoare triple {417#(<= 2 ~N~0)} assume !(main_~i~0 < ~N~0); {417#(<= 2 ~N~0)} is VALID [2020-07-28 14:55:16,019 INFO L280 TraceCheckUtils]: 10: Hoare triple {417#(<= 2 ~N~0)} main_~i~0 := 0; {418#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} is VALID [2020-07-28 14:55:16,019 INFO L280 TraceCheckUtils]: 11: Hoare triple {418#(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); {418#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} is VALID [2020-07-28 14:55:16,020 INFO L280 TraceCheckUtils]: 12: Hoare triple {418#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} assume 2 == 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; {418#(and (= 0 ULTIMATE.start_main_~i~0) (<= 2 ~N~0))} is VALID [2020-07-28 14:55:16,021 INFO L280 TraceCheckUtils]: 13: Hoare triple {418#(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; {419#(<= (+ ULTIMATE.start_main_~i~0 1) ~N~0)} is VALID [2020-07-28 14:55:16,021 INFO L280 TraceCheckUtils]: 14: Hoare triple {419#(<= (+ ULTIMATE.start_main_~i~0 1) ~N~0)} assume !(main_~i~0 < ~N~0); {414#false} is VALID [2020-07-28 14:55:16,022 INFO L280 TraceCheckUtils]: 15: Hoare triple {414#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {414#false} is VALID [2020-07-28 14:55:16,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {414#false} assume 0 == __VERIFIER_assert_~cond; {414#false} is VALID [2020-07-28 14:55:16,022 INFO L280 TraceCheckUtils]: 17: Hoare triple {414#false} assume !false; {414#false} is VALID [2020-07-28 14:55:16,023 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:55:16,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859212555] [2020-07-28 14:55:16,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42195219] [2020-07-28 14:55:16,023 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:55:16,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:55:16,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:55:16,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:55:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:16,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:55:16,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {413#true} is VALID [2020-07-28 14:55:16,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {413#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; {413#true} is VALID [2020-07-28 14:55:16,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {413#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; {413#true} is VALID [2020-07-28 14:55:16,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {413#true} assume !(0 == assume_abort_if_not_~cond); {413#true} is VALID [2020-07-28 14:55:16,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {413#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; {435#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:16,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {435#(<= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {435#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:16,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {435#(<= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {416#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:16,255 INFO L280 TraceCheckUtils]: 7: Hoare triple {416#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {417#(<= 2 ~N~0)} is VALID [2020-07-28 14:55:16,256 INFO L280 TraceCheckUtils]: 8: Hoare triple {417#(<= 2 ~N~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {417#(<= 2 ~N~0)} is VALID [2020-07-28 14:55:16,257 INFO L280 TraceCheckUtils]: 9: Hoare triple {417#(<= 2 ~N~0)} assume !(main_~i~0 < ~N~0); {417#(<= 2 ~N~0)} is VALID [2020-07-28 14:55:16,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {417#(<= 2 ~N~0)} main_~i~0 := 0; {454#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:55:16,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {454#(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); {454#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:55:16,260 INFO L280 TraceCheckUtils]: 12: Hoare triple {454#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} assume 2 == 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; {454#(and (<= ULTIMATE.start_main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:55:16,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {454#(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; {464#(and (<= 2 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:55:16,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {464#(and (<= 2 ~N~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < ~N~0); {414#false} is VALID [2020-07-28 14:55:16,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {414#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {414#false} is VALID [2020-07-28 14:55:16,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {414#false} assume 0 == __VERIFIER_assert_~cond; {414#false} is VALID [2020-07-28 14:55:16,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {414#false} assume !false; {414#false} is VALID [2020-07-28 14:55:16,264 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:55:16,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:55:16,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:55:16,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990821694] [2020-07-28 14:55:16,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:55:16,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:16,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:55:16,312 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:55:16,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:55:16,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:55:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:55:16,314 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2020-07-28 14:55:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:16,698 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-28 14:55:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 14:55:16,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-28 14:55:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:55:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-28 14:55:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:55:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-28 14:55:16,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2020-07-28 14:55:16,760 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:55:16,762 INFO L225 Difference]: With dead ends: 33 [2020-07-28 14:55:16,763 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 14:55:16,764 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:55:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 14:55:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-07-28 14:55:16,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:16,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2020-07-28 14:55:16,792 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2020-07-28 14:55:16,793 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2020-07-28 14:55:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:16,795 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 14:55:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 14:55:16,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:16,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:16,795 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2020-07-28 14:55:16,796 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2020-07-28 14:55:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:16,797 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 14:55:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 14:55:16,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:16,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:16,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:16,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 14:55:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-28 14:55:16,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2020-07-28 14:55:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:16,800 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-28 14:55:16,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:55:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:55:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:55:16,801 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:16,801 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:55:17,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:55:17,012 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2020-07-28 14:55:17,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:17,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448918765] [2020-07-28 14:55:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:17,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {615#true} is VALID [2020-07-28 14:55:17,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#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; {615#true} is VALID [2020-07-28 14:55:17,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {615#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; {615#true} is VALID [2020-07-28 14:55:17,099 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} assume !(0 == assume_abort_if_not_~cond); {615#true} is VALID [2020-07-28 14:55:17,100 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#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; {617#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:17,101 INFO L280 TraceCheckUtils]: 5: Hoare triple {617#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {617#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:17,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {617#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {618#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:55:17,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {619#(<= ~N~0 1)} is VALID [2020-07-28 14:55:17,104 INFO L280 TraceCheckUtils]: 8: Hoare triple {619#(<= ~N~0 1)} main_~i~0 := 0; {620#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {620#(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); {620#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {620#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume 2 == 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; {620#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,106 INFO L280 TraceCheckUtils]: 11: Hoare triple {620#(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; {621#(<= ~N~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:55:17,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {621#(<= ~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); {616#false} is VALID [2020-07-28 14:55:17,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#false} assume 2 == 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; {616#false} is VALID [2020-07-28 14:55:17,107 INFO L280 TraceCheckUtils]: 14: Hoare triple {616#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {616#false} is VALID [2020-07-28 14:55:17,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {616#false} assume !(main_~i~0 < ~N~0); {616#false} is VALID [2020-07-28 14:55:17,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {616#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {616#false} is VALID [2020-07-28 14:55:17,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#false} assume 0 == __VERIFIER_assert_~cond; {616#false} is VALID [2020-07-28 14:55:17,108 INFO L280 TraceCheckUtils]: 18: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-28 14:55:17,109 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:55:17,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448918765] [2020-07-28 14:55:17,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727991211] [2020-07-28 14:55:17,110 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:55:17,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 14:55:17,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:55:17,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:55:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:17,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:55:17,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {615#true} is VALID [2020-07-28 14:55:17,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#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; {615#true} is VALID [2020-07-28 14:55:17,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {615#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; {615#true} is VALID [2020-07-28 14:55:17,319 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} assume !(0 == assume_abort_if_not_~cond); {615#true} is VALID [2020-07-28 14:55:17,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#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; {637#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:55:17,320 INFO L280 TraceCheckUtils]: 5: Hoare triple {637#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < ~N~0);call write~int(2, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {637#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:55:17,321 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {618#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:55:17,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {619#(<= ~N~0 1)} is VALID [2020-07-28 14:55:17,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {619#(<= ~N~0 1)} main_~i~0 := 0; {650#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {650#(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); {650#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {650#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume 2 == 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; {650#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {650#(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; {660#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:55:17,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#(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); {616#false} is VALID [2020-07-28 14:55:17,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#false} assume 2 == 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; {616#false} is VALID [2020-07-28 14:55:17,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {616#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {616#false} is VALID [2020-07-28 14:55:17,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {616#false} assume !(main_~i~0 < ~N~0); {616#false} is VALID [2020-07-28 14:55:17,333 INFO L280 TraceCheckUtils]: 16: Hoare triple {616#false} call main_#t~mem9 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem9 == 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {616#false} is VALID [2020-07-28 14:55:17,334 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#false} assume 0 == __VERIFIER_assert_~cond; {616#false} is VALID [2020-07-28 14:55:17,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-28 14:55:17,335 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:55:17,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:55:17,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:55:17,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200241629] [2020-07-28 14:55:17,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-28 14:55:17,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:17,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:55:17,371 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:55:17,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:55:17,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:55:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:55:17,373 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2020-07-28 14:55:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:19,704 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-28 14:55:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 14:55:19,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-28 14:55:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:55:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-28 14:55:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:55:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-28 14:55:19,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2020-07-28 14:55:19,775 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:55:19,777 INFO L225 Difference]: With dead ends: 37 [2020-07-28 14:55:19,777 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 14:55:19,778 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:55:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 14:55:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-07-28 14:55:19,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:19,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2020-07-28 14:55:19,803 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2020-07-28 14:55:19,803 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2020-07-28 14:55:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:19,804 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:55:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:55:19,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:19,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:19,805 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2020-07-28 14:55:19,806 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2020-07-28 14:55:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:19,807 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 14:55:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:55:19,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:19,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:19,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:19,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:55:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-07-28 14:55:19,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2020-07-28 14:55:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:19,811 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-28 14:55:19,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:55:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-28 14:55:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:55:19,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:19,812 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:55:20,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:55:20,023 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2020-07-28 14:55:20,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:20,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775563689] [2020-07-28 14:55:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:55:20,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:55:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:55:20,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:55:20,142 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:55:20,142 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:55:20,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 14:55:20,182 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:55:20,182 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:55:20,182 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:55:20,182 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:55:20,183 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 14:55:20,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:55:20,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:55:20,183 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:55:20,183 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:55:20,183 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:55:20,184 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:55:20,184 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:55:20,184 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:55:20,184 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:55:20,184 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:55:20,184 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:55:20,185 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:55:20,185 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 14:55:20,185 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:55:20,185 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:55:20,185 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:55:20,186 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:55:20,186 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 14:55:20,186 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:55:20,186 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:55:20,186 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:55:20,186 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:55:20,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:55:20 BoogieIcfgContainer [2020-07-28 14:55:20,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:55:20,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:55:20,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:55:20,190 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:55:20,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:55:04" (3/4) ... [2020-07-28 14:55:20,192 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:55:20,256 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:55:20,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:55:20,259 INFO L168 Benchmark]: Toolchain (without parser) took 17124.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 952.2 MB in the beginning and 975.3 MB in the end (delta: -23.2 MB). Peak memory consumption was 264.2 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:20,259 INFO L168 Benchmark]: CDTParser took 0.36 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:55:20,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:20,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:20,261 INFO L168 Benchmark]: Boogie Preprocessor took 58.01 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:55:20,262 INFO L168 Benchmark]: RCFGBuilder took 431.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:20,262 INFO L168 Benchmark]: TraceAbstraction took 16119.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 975.3 MB in the end (delta: 129.3 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:20,263 INFO L168 Benchmark]: Witness Printer took 67.47 ms. Allocated memory is still 1.3 GB. Free memory was 975.3 MB in the beginning and 975.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-28 14:55:20,266 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.36 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 314.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.01 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 431.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16119.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 975.3 MB in the end (delta: 129.3 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. * Witness Printer took 67.47 ms. Allocated memory is still 1.3 GB. Free memory was 975.3 MB in the beginning and 975.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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