./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c3fbe1c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8538ad1ae962a1ba831f755fb5c2de9d27f82db5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:07:02,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:07:02,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:07:02,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:07:02,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:07:02,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:07:02,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:07:02,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:07:02,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:07:02,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:07:02,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:07:02,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:07:02,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:07:02,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:07:02,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:07:02,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:07:02,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:07:02,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:07:02,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:07:02,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:07:02,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:07:02,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:07:02,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:07:02,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:07:02,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:07:02,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:07:02,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:07:02,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:07:02,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:07:02,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:07:02,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:07:02,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:07:02,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:07:02,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:07:02,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:07:02,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:07:02,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 15:07:02,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:07:02,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:07:02,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:07:02,279 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 15:07:02,280 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 15:07:02,283 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 15:07:02,283 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 15:07:02,283 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 15:07:02,283 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 15:07:02,283 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 15:07:02,284 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 15:07:02,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:07:02,284 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 15:07:02,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:07:02,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 15:07:02,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:07:02,285 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:07:02,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:07:02,285 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:07:02,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 15:07:02,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:07:02,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:07:02,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:07:02,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:07:02,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:07:02,287 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:07:02,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:07:02,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:07:02,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:07:02,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:07:02,288 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 15:07:02,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:07:02,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:07:02,289 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:07:02,289 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/UTaipan-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 -> Taipan 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 -> 8538ad1ae962a1ba831f755fb5c2de9d27f82db5 [2018-10-22 15:07:02,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:07:02,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:07:02,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:07:02,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:07:02,388 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:07:02,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-10-22 15:07:02,447 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5a04643e0/17f3af25e66d410b84181cdf30c9b99e/FLAGb18071f6c [2018-10-22 15:07:02,853 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:07:02,854 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-10-22 15:07:02,861 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5a04643e0/17f3af25e66d410b84181cdf30c9b99e/FLAGb18071f6c [2018-10-22 15:07:02,876 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5a04643e0/17f3af25e66d410b84181cdf30c9b99e [2018-10-22 15:07:02,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:07:02,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 15:07:02,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:07:02,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:07:02,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:07:02,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:07:02" (1/1) ... [2018-10-22 15:07:02,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4041b019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:02, skipping insertion in model container [2018-10-22 15:07:02,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:07:02" (1/1) ... [2018-10-22 15:07:02,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:07:02,929 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:07:03,162 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:07:03,172 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:07:03,195 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:07:03,217 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:07:03,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03 WrapperNode [2018-10-22 15:07:03,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:07:03,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:07:03,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:07:03,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:07:03,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:07:03,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:07:03,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:07:03,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:07:03,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... [2018-10-22 15:07:03,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:07:03,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:07:03,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:07:03,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:07:03,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 15:07:03,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 15:07:03,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 15:07:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:07:03,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:07:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 15:07:03,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 15:07:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 15:07:03,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 15:07:03,824 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:07:03,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:07:03 BoogieIcfgContainer [2018-10-22 15:07:03,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:07:03,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:07:03,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:07:03,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:07:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:07:02" (1/3) ... [2018-10-22 15:07:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd2068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:07:03, skipping insertion in model container [2018-10-22 15:07:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:07:03" (2/3) ... [2018-10-22 15:07:03,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd2068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:07:03, skipping insertion in model container [2018-10-22 15:07:03,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:07:03" (3/3) ... [2018-10-22 15:07:03,832 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-10-22 15:07:03,841 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:07:03,848 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:07:03,863 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:07:03,899 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:07:03,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:07:03,900 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:07:03,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:07:03,900 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:07:03,900 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:07:03,901 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:07:03,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:07:03,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:07:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-10-22 15:07:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-22 15:07:03,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:07:03,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:07:03,939 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:07:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:07:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 853272646, now seen corresponding path program 1 times [2018-10-22 15:07:03,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:07:03,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:03,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:03,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:03,995 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:07:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:04,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:07:04,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 15:07:04,233 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:07:04,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 15:07:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 15:07:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:07:04,253 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-10-22 15:07:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:07:04,489 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-10-22 15:07:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 15:07:04,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-22 15:07:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:07:04,501 INFO L225 Difference]: With dead ends: 62 [2018-10-22 15:07:04,501 INFO L226 Difference]: Without dead ends: 34 [2018-10-22 15:07:04,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:07:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-22 15:07:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-10-22 15:07:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-22 15:07:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-22 15:07:04,552 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2018-10-22 15:07:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:07:04,553 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-22 15:07:04,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 15:07:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-22 15:07:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-22 15:07:04,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:07:04,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:07:04,556 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:07:04,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:07:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash 653700861, now seen corresponding path program 1 times [2018-10-22 15:07:04,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:07:04,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:04,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:04,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:04,559 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:07:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:04,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:07:04,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:07:04,649 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:07:04,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:07:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:07:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:07:04,652 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-10-22 15:07:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:07:04,665 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-22 15:07:04,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:07:04,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-22 15:07:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:07:04,667 INFO L225 Difference]: With dead ends: 40 [2018-10-22 15:07:04,668 INFO L226 Difference]: Without dead ends: 29 [2018-10-22 15:07:04,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:07:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-22 15:07:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-10-22 15:07:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-22 15:07:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-10-22 15:07:04,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2018-10-22 15:07:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:07:04,677 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-22 15:07:04,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:07:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-10-22 15:07:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-22 15:07:04,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:07:04,680 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:07:04,680 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:07:04,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:07:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1313509780, now seen corresponding path program 1 times [2018-10-22 15:07:04,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:07:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:04,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:04,682 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:07:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:05,046 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-10-22 15:07:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:05,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:07:05,289 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:07:05,290 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-10-22 15:07:05,292 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [17], [44], [47], [49], [52], [54], [55], [56], [57], [59], [60] [2018-10-22 15:07:05,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:07:05,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:07:05,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 15:07:05,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 15:07:05,985 INFO L272 AbstractInterpreter]: Visited 16 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-10-22 15:07:06,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:07:06,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 15:07:06,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:07:06,003 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:07:06,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:06,013 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:07:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:06,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:07:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:06,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:07:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:07,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:07:07,383 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:07:07,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:07,410 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:07:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:07,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:07:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:07,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:07:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:07,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:07:07,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8, 7, 7] total 18 [2018-10-22 15:07:07,839 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:07:07,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 15:07:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 15:07:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-22 15:07:07,841 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-10-22 15:07:09,342 WARN L179 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-22 15:07:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:07:15,764 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-10-22 15:07:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 15:07:15,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-10-22 15:07:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:07:15,767 INFO L225 Difference]: With dead ends: 39 [2018-10-22 15:07:15,767 INFO L226 Difference]: Without dead ends: 37 [2018-10-22 15:07:15,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-10-22 15:07:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-22 15:07:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-10-22 15:07:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-22 15:07:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-22 15:07:15,783 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2018-10-22 15:07:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:07:15,784 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-22 15:07:15,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 15:07:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-22 15:07:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-22 15:07:15,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:07:15,787 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:07:15,787 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:07:15,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:07:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2042551023, now seen corresponding path program 1 times [2018-10-22 15:07:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:07:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:15,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:07:15,790 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:07:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:16,288 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-22 15:07:18,522 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse22 (div (+ c_main_~index1~0 (- 1)) 4294967296))) (let ((.cse8 (* 4294967296 .cse22))) (and (let ((.cse21 (* 34359738368 .cse22)) (.cse11 (* 4 c_main_~index2~0)) (.cse23 (* 8589934592 .cse22))) (let ((.cse14 (+ .cse23 c_main_~index2~0 1)) (.cse1 (+ .cse23 c_main_~index2~0)) (.cse4 (+ .cse21 .cse11 3)) (.cse7 (select |c_#memory_int| |c_main_~#array~0.base|)) (.cse10 (* 17179869184 .cse22)) (.cse3 (+ .cse21 .cse11 4)) (.cse12 (<= (* 4294967296 (div (+ c_main_~index2~0 4294867297) 4294967296)) c_main_~index2~0)) (.cse13 (* 4 c_main_~index1~0))) (or (let ((.cse9 (div (+ c_main_~index1~0 (+ c_main_~index2~0 8589734593)) 4294967296))) (let ((.cse0 (+ c_main_~index1~0 (* 4294967296 .cse9)))) (and (or (<= .cse0 .cse1) (let ((.cse2 (+ .cse13 (* 17179869184 .cse9)))) (and (<= .cse2 .cse3) (or (<= .cse2 .cse4) (let ((.cse5 (select .cse7 (+ |c_main_~#array~0.offset| (+ .cse10 (+ .cse11 (* (- 17179869184) .cse9))))))) (<= .cse5 (let ((.cse6 (select .cse7 (+ |c_main_~#array~0.offset| (* 4 (+ .cse8 (+ c_main_~index2~0 (+ (* (- 4294967296) .cse9) 1)))))))) (+ .cse6 (* 4294967296 (div (+ (- .cse6) .cse5) 4294967296))))))) .cse12))) (<= .cse0 .cse14)))) (let ((.cse19 (div (+ c_main_~index1~0 (+ c_main_~index2~0 4294767297)) 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse15 (+ .cse20 c_main_~index1~0))) (and (<= .cse15 .cse14) (or (<= .cse15 .cse1) (let ((.cse16 (+ (* 17179869184 .cse19) .cse13))) (and (or (<= .cse16 .cse4) (let ((.cse17 (select .cse7 (+ |c_main_~#array~0.offset| (+ .cse10 (+ .cse11 (* (- 17179869184) .cse19))))))) (<= .cse17 (let ((.cse18 (select .cse7 (+ |c_main_~#array~0.offset| (* 4 (+ .cse8 (+ c_main_~index2~0 (+ (* (- 4294967296) .cse19) 1)))))))) (+ (* 4294967296 (div (+ (- .cse18) .cse17) 4294967296)) .cse18))))) (<= .cse16 .cse3) .cse12))) (<= c_main_~index1~0 (+ (* 4294967296 (div (+ (- c_main_~index2~0) (+ .cse20 99998)) 4294967296)) 100000))))))))) (<= c_main_~index1~0 (+ .cse8 100000))))) is different from false [2018-10-22 15:07:18,700 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-22 15:07:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-22 15:07:18,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:07:18,767 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:07:18,767 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-22 15:07:18,767 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [15], [17], [23], [27], [33], [44], [47], [49], [52], [54], [55], [56], [57], [59], [60], [61] [2018-10-22 15:07:18,770 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:07:18,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:07:18,779 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 15:07:19,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 15:07:19,024 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-10-22 15:07:19,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:07:19,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 15:07:19,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:07:19,063 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:07:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:19,077 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:07:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:19,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:07:27,759 WARN L179 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2018-10-22 15:07:28,425 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-22 15:07:28,473 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-22 15:07:28,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:07:31,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-10-22 15:07:31,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:07:31,696 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:31,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:07:33,747 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (+ (* 4 (mod v_prenex_9 4294967296)) v_prenex_10) (+ (* 4 (mod (+ v_prenex_8 1) 4294967296)) v_prenex_10)) [2018-10-22 15:07:34,166 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:34,168 INFO L303 Elim1Store]: Index analysis took 2807 ms [2018-10-22 15:07:34,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 59 [2018-10-22 15:07:34,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:07:34,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:34,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:34,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 20 variables, input treesize:461, output treesize:7 [2018-10-22 15:07:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:34,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:07:38,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2018-10-22 15:07:38,840 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:38,849 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:38,852 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:38,856 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:38,857 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:38,861 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:38,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 144 [2018-10-22 15:07:38,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:07:39,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:39,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2018-10-22 15:07:39,473 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,474 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,474 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,475 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,476 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,479 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 141 [2018-10-22 15:07:39,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-22 15:07:39,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:39,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2018-10-22 15:07:39,782 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,813 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,825 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,838 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,851 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,956 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:39,981 INFO L303 Elim1Store]: Index analysis took 230 ms [2018-10-22 15:07:40,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 135 [2018-10-22 15:07:40,078 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-22 15:07:40,114 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:40,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-10-22 15:07:40,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,495 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:40,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 133 [2018-10-22 15:07:40,524 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-22 15:07:40,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:40,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2018-10-22 15:07:40,860 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:42,864 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (+ (* 4 (mod main_~index2~0 4294967296)) v_prenex_36) (+ (* 4 (mod (+ main_~index1~0 1) 4294967296)) v_prenex_36)) [2018-10-22 15:07:42,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:42,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:44,871 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ main_~index2~0 4294967295) 4294967296)) v_prenex_36) (+ (* 4 (mod main_~index1~0 4294967296)) v_prenex_36)) [2018-10-22 15:07:44,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:46,879 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimCell_22 (+ (* 4 (mod (+ main_~index1~0 1) 4294967296)) v_prenex_36)) (select v_arrayElimCell_22 (+ (* 4 (mod main_~index2~0 4294967296)) v_prenex_36))) [2018-10-22 15:07:48,898 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_22 (+ (* 4 (mod main_~index1~0 4294967296)) v_prenex_36)) (select v_arrayElimCell_22 (+ (* 4 (mod main_~index2~0 4294967296)) v_prenex_36))) [2018-10-22 15:07:48,899 INFO L303 Elim1Store]: Index analysis took 8047 ms [2018-10-22 15:07:48,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 115 [2018-10-22 15:07:48,988 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-22 15:07:49,019 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:49,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 12 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:07:49,038 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 36 variables, input treesize:1521, output treesize:29 [2018-10-22 15:07:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:50,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:07:50,453 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:07:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:07:50,470 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:07:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:07:50,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:07:57,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2018-10-22 15:07:57,341 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:57,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:07:57,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:07:57,375 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:07:57,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-10-22 15:07:57,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:07:57,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:57,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:07:57,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:381, output treesize:7 [2018-10-22 15:07:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:07:57,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:08:01,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2018-10-22 15:08:03,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:05,909 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (+ (* 4 (mod main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)) (+ (* 4 (mod (+ main_~index2~0 4294967295) 4294967296)) |main_~#array~0.offset| (- 17179869184))) [2018-10-22 15:08:05,911 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:05,911 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:05,917 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:05,919 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:05,931 INFO L303 Elim1Store]: Index analysis took 4047 ms [2018-10-22 15:08:05,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 125 [2018-10-22 15:08:05,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:08:06,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:08:06,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2018-10-22 15:08:06,255 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,256 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,257 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,257 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,259 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 141 [2018-10-22 15:08:06,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-22 15:08:06,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:08:06,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2018-10-22 15:08:06,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,585 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 135 [2018-10-22 15:08:06,613 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-22 15:08:06,645 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:08:06,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-10-22 15:08:06,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,749 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 133 [2018-10-22 15:08:06,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-22 15:08:06,778 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:08:06,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2018-10-22 15:08:06,872 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,879 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,885 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,886 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:06,887 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:08,898 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_48 (+ (* 4 (mod main_~index1~0 4294967296)) |main_~#array~0.offset|)) (select v_arrayElimCell_48 (+ (* 4 (mod main_~index2~0 4294967296)) |main_~#array~0.offset|))) [2018-10-22 15:08:10,903 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimCell_48 (+ (* 4 (mod main_~index2~0 4294967296)) |main_~#array~0.offset|)) (select v_arrayElimCell_48 (+ (* 4 (mod (+ main_~index1~0 1) 4294967296)) |main_~#array~0.offset|))) [2018-10-22 15:08:10,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:08:10,909 INFO L303 Elim1Store]: Index analysis took 4041 ms [2018-10-22 15:08:10,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 132 [2018-10-22 15:08:10,924 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-22 15:08:10,961 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:08:11,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:08:11,024 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:1521, output treesize:29 [2018-10-22 15:08:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:08:11,141 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-10-22 15:08:11,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [10, 11, 9] total 22 [2018-10-22 15:08:11,141 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:08:11,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-22 15:08:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-22 15:08:11,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=341, Unknown=7, NotChecked=38, Total=462 [2018-10-22 15:08:11,146 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-10-22 15:08:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:08:15,869 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-10-22 15:08:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 15:08:15,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-10-22 15:08:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:08:15,871 INFO L225 Difference]: With dead ends: 43 [2018-10-22 15:08:15,871 INFO L226 Difference]: Without dead ends: 41 [2018-10-22 15:08:15,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 17 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=106, Invalid=442, Unknown=8, NotChecked=44, Total=600 [2018-10-22 15:08:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-22 15:08:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-10-22 15:08:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-22 15:08:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-22 15:08:15,880 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 23 [2018-10-22 15:08:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:08:15,881 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-22 15:08:15,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-22 15:08:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-22 15:08:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-22 15:08:15,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:08:15,883 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:08:15,883 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:08:15,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:08:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash -856614261, now seen corresponding path program 1 times [2018-10-22 15:08:15,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:08:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:08:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:08:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:08:15,886 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:08:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:08:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:08:18,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:08:18,639 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:08:18,639 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-22 15:08:18,639 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [15], [17], [23], [27], [33], [35], [44], [47], [49], [52], [54], [55], [56], [57], [59], [60], [61], [62] [2018-10-22 15:08:18,642 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:08:18,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:08:18,651 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 15:08:18,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 15:08:18,816 INFO L272 AbstractInterpreter]: Visited 23 different actions 40 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-10-22 15:08:18,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:08:18,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 15:08:18,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:08:18,856 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:08:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:08:18,871 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:08:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:08:18,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:08:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:08:22,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:08:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:08:26,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:08:26,215 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:08:26,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:08:26,233 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:08:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:08:26,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:08:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:08:28,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:08:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:08:32,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-10-22 15:08:32,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 4, 4, 6] total 15 [2018-10-22 15:08:32,657 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:08:32,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:08:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:08:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=144, Unknown=5, NotChecked=0, Total=210 [2018-10-22 15:08:32,658 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2018-10-22 15:08:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:08:38,758 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-10-22 15:08:38,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 15:08:38,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-22 15:08:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:08:38,770 INFO L225 Difference]: With dead ends: 37 [2018-10-22 15:08:38,770 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 15:08:38,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=61, Invalid=144, Unknown=5, NotChecked=0, Total=210 [2018-10-22 15:08:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 15:08:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 15:08:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 15:08:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 15:08:38,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-10-22 15:08:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:08:38,772 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 15:08:38,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:08:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 15:08:38,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 15:08:38,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 15:08:39,004 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2018-10-22 15:08:39,145 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-10-22 15:08:39,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-22 15:08:39,260 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-22 15:08:39,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 15:08:39,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 15:08:39,261 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 15:08:39,261 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 15:08:39,261 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 15:08:39,261 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 37) no Hoare annotation was computed. [2018-10-22 15:08:39,261 INFO L421 ceAbstractionStarter]: At program point L31-3(lines 31 37) the Hoare annotation is: (let ((.cse0 (= 0 |main_~#array~0.offset|))) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (= main_~loop_entered~0 0) .cse0 (< (mod main_~index1~0 4294967296) 100000)) (let ((.cse2 (mod (+ main_~index2~0 1) 4294967296)) (.cse1 (mod (+ main_~index1~0 4294967295) 4294967296))) (and (< .cse1 .cse2) .cse0 (< .cse2 100000) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse3 (+ (* 4 .cse2) |main_~#array~0.offset|)) 4294967296) (mod (select .cse3 (+ (* 4 .cse1) |main_~#array~0.offset|)) 4294967296))))))) [2018-10-22 15:08:39,261 INFO L425 ceAbstractionStarter]: For program point L31-4(lines 20 47) no Hoare annotation was computed. [2018-10-22 15:08:39,261 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2018-10-22 15:08:39,262 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2018-10-22 15:08:39,262 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2018-10-22 15:08:39,262 INFO L421 ceAbstractionStarter]: At program point L40-3(lines 40 44) the Hoare annotation is: (or (let ((.cse1 (mod (+ main_~index2~0 1) 4294967296)) (.cse0 (mod (+ main_~index1~0 4294967295) 4294967296))) (and (< .cse0 .cse1) (= 0 |main_~#array~0.offset|) (< .cse1 100000) (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse2 (+ (* 4 .cse1) |main_~#array~0.offset|)) 4294967296) (mod (select .cse2 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296))))) (<= (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296))) [2018-10-22 15:08:39,262 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (or (and (< (mod (+ main_~index1~0 4294967295) 4294967296) (mod (+ main_~index2~0 1) 4294967296)) (<= main_~index2~0 (+ .cse0 99998)) (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))) (and (<= main_~index2~0 (+ .cse0 99999)) (= main_~loop_entered~0 0) (< (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296))))) (= 0 |main_~#array~0.offset|)) [2018-10-22 15:08:39,262 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-10-22 15:08:39,262 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2018-10-22 15:08:39,262 INFO L421 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse1 (mod (+ main_~index2~0 1) 4294967296)) (.cse0 (mod (+ main_~index1~0 4294967295) 4294967296))) (and (< .cse0 .cse1) (= 0 |main_~#array~0.offset|) (< .cse1 100000) (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse2 (+ (* 4 .cse1) |main_~#array~0.offset|)) 4294967296) (mod (select .cse2 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296))) (<= (mod main_~index2~0 4294967296) (mod main_~index1~0 4294967296)) (<= |main_#t~mem8| (+ |main_#t~mem7| (* 4294967296 (div (+ |main_#t~mem8| (- |main_#t~mem7|)) 4294967296)))))) [2018-10-22 15:08:39,263 INFO L425 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-10-22 15:08:39,266 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-10-22 15:08:39,266 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-10-22 15:08:39,266 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-10-22 15:08:39,266 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-10-22 15:08:39,266 INFO L425 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-10-22 15:08:39,266 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-10-22 15:08:39,266 INFO L425 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-10-22 15:08:39,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,289 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,298 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:08:39 BoogieIcfgContainer [2018-10-22 15:08:39,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:08:39,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 15:08:39,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 15:08:39,304 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 15:08:39,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:07:03" (3/4) ... [2018-10-22 15:08:39,310 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 15:08:39,316 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 15:08:39,316 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 15:08:39,317 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 15:08:39,328 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-10-22 15:08:39,329 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-10-22 15:08:39,330 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-22 15:08:39,330 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-22 15:08:39,400 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 15:08:39,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 15:08:39,401 INFO L168 Benchmark]: Toolchain (without parser) took 96518.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.3 MB). Free memory was 951.9 MB in the beginning and 909.1 MB in the end (delta: 42.7 MB). Peak memory consumption was 308.0 MB. Max. memory is 11.5 GB. [2018-10-22 15:08:39,406 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 15:08:39,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 15:08:39,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-22 15:08:39,407 INFO L168 Benchmark]: Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 15:08:39,410 INFO L168 Benchmark]: RCFGBuilder took 539.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-10-22 15:08:39,418 INFO L168 Benchmark]: TraceAbstraction took 95478.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 222.9 MB). Peak memory consumption was 330.4 MB. Max. memory is 11.5 GB. [2018-10-22 15:08:39,418 INFO L168 Benchmark]: Witness Printer took 96.68 ms. Allocated memory is still 1.3 GB. Free memory is still 909.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 15:08:39,425 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 539.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95478.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 222.9 MB). Peak memory consumption was 330.4 MB. Max. memory is 11.5 GB. * Witness Printer took 96.68 ms. Allocated memory is still 1.3 GB. Free memory is still 909.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2018-10-22 15:08:39,433 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((index2 <= 4294967296 * (index2 / 4294967296) + 99999 && loop_entered == 0) && 0 == array) && index1 % 4294967296 < 100000) || ((((index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296 && 0 == array) && (index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) - InvariantResult [Line: 40]: Loop Invariant [2018-10-22 15:08:39,446 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,447 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,447 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 15:08:39,447 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296 && 0 == array) && (index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) || index1 % 4294967296 <= index2 % 4294967296 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 95.3s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 53 SDslu, 303 SDs, 0 SdLazy, 231 SolverSat, 22 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 247 SyntacticMatches, 28 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 49.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 275 HoareAnnotationTreeSize, 14 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 230 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 73.5s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 143099 SizeOfPredicates, 46 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 86/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...