./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d80676b9a99131191df12fd74204f331d0509f64 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:01:23,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:01:23,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:01:23,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:01:23,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:01:23,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:01:23,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:01:23,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:01:23,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:01:23,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:01:23,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:01:23,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:01:23,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:01:23,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:01:23,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:01:23,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:01:23,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:01:23,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:01:23,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:01:23,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:01:23,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:01:23,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:01:23,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:01:23,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:01:23,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:01:23,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:01:23,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:01:23,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:01:23,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:01:23,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:01:23,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:01:23,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:01:23,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:01:23,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:01:23,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:01:23,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:01:23,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:01:23,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:01:23,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:01:23,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:01:23,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:01:23,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:01:23,277 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:01:23,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:01:23,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:01:23,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:01:23,282 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:01:23,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:01:23,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:01:23,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:01:23,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:01:23,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:01:23,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:01:23,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:01:23,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:01:23,285 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:01:23,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:01:23,286 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:01:23,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:01:23,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:01:23,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:01:23,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:01:23,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:01:23,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:23,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:01:23,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:01:23,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:01:23,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:01:23,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:01:23,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:01:23,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d80676b9a99131191df12fd74204f331d0509f64 [2019-11-28 00:01:23,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:01:23,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:01:23,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:01:23,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:01:23,604 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:01:23,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-11-28 00:01:23,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e93592ce/d7afb94a190f49cf92a49eb2035e9f7f/FLAG40796e0dc [2019-11-28 00:01:24,119 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:01:24,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-11-28 00:01:24,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e93592ce/d7afb94a190f49cf92a49eb2035e9f7f/FLAG40796e0dc [2019-11-28 00:01:24,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e93592ce/d7afb94a190f49cf92a49eb2035e9f7f [2019-11-28 00:01:24,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:01:24,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:01:24,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:24,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:01:24,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:01:24,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d28e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24, skipping insertion in model container [2019-11-28 00:01:24,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:01:24,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:01:24,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:24,742 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:01:24,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:24,851 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:01:24,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24 WrapperNode [2019-11-28 00:01:24,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:24,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:24,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:01:24,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:01:24,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:24,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:01:24,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:01:24,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:01:24,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... [2019-11-28 00:01:24,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:01:24,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:01:24,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:01:24,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:01:24,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:24,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:01:24,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:01:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 00:01:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:01:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 00:01:25,331 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:01:25,331 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:01:25,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:25 BoogieIcfgContainer [2019-11-28 00:01:25,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:01:25,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:01:25,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:01:25,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:01:25,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:01:24" (1/3) ... [2019-11-28 00:01:25,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77522f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:25, skipping insertion in model container [2019-11-28 00:01:25,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:24" (2/3) ... [2019-11-28 00:01:25,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77522f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:25, skipping insertion in model container [2019-11-28 00:01:25,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:25" (3/3) ... [2019-11-28 00:01:25,339 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-11-28 00:01:25,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:01:25,355 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 00:01:25,365 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 00:01:25,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:01:25,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:01:25,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:01:25,386 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:01:25,386 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:01:25,386 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:01:25,386 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:01:25,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:01:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-11-28 00:01:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:01:25,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:25,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:25,406 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -549247241, now seen corresponding path program 1 times [2019-11-28 00:01:25,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:25,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913034076] [2019-11-28 00:01:25,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913034076] [2019-11-28 00:01:25,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:25,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:01:25,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569686544] [2019-11-28 00:01:25,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:01:25,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:01:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:25,617 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-11-28 00:01:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:25,648 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2019-11-28 00:01:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:01:25,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 00:01:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:25,659 INFO L225 Difference]: With dead ends: 51 [2019-11-28 00:01:25,659 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 00:01:25,663 INFO L630 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 [2019-11-28 00:01:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 00:01:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 00:01:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 00:01:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-28 00:01:25,698 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2019-11-28 00:01:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:25,699 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 00:01:25,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:01:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-28 00:01:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:01:25,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:25,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:25,701 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:25,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2084862863, now seen corresponding path program 1 times [2019-11-28 00:01:25,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:25,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957091336] [2019-11-28 00:01:25,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:25,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957091336] [2019-11-28 00:01:25,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:25,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:01:25,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226374337] [2019-11-28 00:01:25,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:01:25,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:01:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:25,757 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-11-28 00:01:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:25,794 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-11-28 00:01:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:01:25,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 00:01:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:25,796 INFO L225 Difference]: With dead ends: 56 [2019-11-28 00:01:25,796 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:01:25,797 INFO L630 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 [2019-11-28 00:01:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:01:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-28 00:01:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 00:01:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-28 00:01:25,803 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-11-28 00:01:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:25,803 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-28 00:01:25,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:01:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-28 00:01:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:01:25,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:25,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:25,805 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2019-11-28 00:01:25,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:25,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480858172] [2019-11-28 00:01:25,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:25,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480858172] [2019-11-28 00:01:25,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:25,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:25,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674709417] [2019-11-28 00:01:25,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:25,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:25,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:25,872 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-11-28 00:01:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:25,910 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-28 00:01:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:25,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 00:01:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:25,912 INFO L225 Difference]: With dead ends: 49 [2019-11-28 00:01:25,912 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:01:25,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:01:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-11-28 00:01:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 00:01:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-28 00:01:25,921 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 10 [2019-11-28 00:01:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:25,921 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-28 00:01:25,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-28 00:01:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:01:25,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:25,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:25,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1998916233, now seen corresponding path program 1 times [2019-11-28 00:01:25,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:25,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563877683] [2019-11-28 00:01:25,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:25,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563877683] [2019-11-28 00:01:25,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:25,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:01:25,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217565051] [2019-11-28 00:01:25,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:01:25,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:01:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:25,977 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2019-11-28 00:01:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:26,031 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-28 00:01:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:01:26,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 00:01:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:26,033 INFO L225 Difference]: With dead ends: 52 [2019-11-28 00:01:26,034 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 00:01:26,034 INFO L630 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 [2019-11-28 00:01:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 00:01:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-28 00:01:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 00:01:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-28 00:01:26,042 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2019-11-28 00:01:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:26,043 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 00:01:26,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:01:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-28 00:01:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:01:26,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:26,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:26,044 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:26,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:26,045 INFO L82 PathProgramCache]: Analyzing trace with hash 588855308, now seen corresponding path program 1 times [2019-11-28 00:01:26,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:26,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826768172] [2019-11-28 00:01:26,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:26,656 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-28 00:01:26,946 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 38 [2019-11-28 00:01:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:27,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826768172] [2019-11-28 00:01:27,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:27,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:01:27,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983767893] [2019-11-28 00:01:27,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:01:27,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:27,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:01:27,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:01:27,025 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-11-28 00:01:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:27,289 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-28 00:01:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:01:27,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 00:01:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:27,291 INFO L225 Difference]: With dead ends: 43 [2019-11-28 00:01:27,291 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 00:01:27,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:01:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 00:01:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-28 00:01:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:01:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 00:01:27,297 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2019-11-28 00:01:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:27,298 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 00:01:27,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:01:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 00:01:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:01:27,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:27,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:27,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 394194232, now seen corresponding path program 1 times [2019-11-28 00:01:27,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:27,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832049557] [2019-11-28 00:01:27,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:27,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832049557] [2019-11-28 00:01:27,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:27,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:01:27,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293481592] [2019-11-28 00:01:27,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:01:27,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:01:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:01:27,359 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2019-11-28 00:01:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:27,428 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-28 00:01:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:01:27,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 00:01:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:27,429 INFO L225 Difference]: With dead ends: 40 [2019-11-28 00:01:27,430 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:01:27,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:01:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:01:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2019-11-28 00:01:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 00:01:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 00:01:27,435 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2019-11-28 00:01:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:27,436 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 00:01:27,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:01:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-28 00:01:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:01:27,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:27,437 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:27,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1945950452, now seen corresponding path program 1 times [2019-11-28 00:01:27,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:27,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339407908] [2019-11-28 00:01:27,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339407908] [2019-11-28 00:01:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764794149] [2019-11-28 00:01:27,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:01:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:27,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:01:27,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:01:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:27,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:01:27,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-28 00:01:27,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426436533] [2019-11-28 00:01:27,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:01:27,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:01:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:27,761 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2019-11-28 00:01:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:30,488 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 00:01:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:01:30,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 00:01:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:30,631 INFO L225 Difference]: With dead ends: 28 [2019-11-28 00:01:30,631 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:01:30,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:01:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:01:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:01:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:01:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:01:30,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-28 00:01:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:30,633 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:01:30,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:01:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:01:30,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:01:30,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:01:30,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:01:33,457 WARN L192 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-28 00:01:33,558 INFO L249 CegarLoopResult]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-11-28 00:01:33,558 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:01:33,559 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:01:33,559 INFO L246 CegarLoopResult]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-11-28 00:01:33,559 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-28 00:01:33,559 INFO L246 CegarLoopResult]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-11-28 00:01:33,559 INFO L242 CegarLoopResult]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-11-28 00:01:33,560 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-11-28 00:01:33,560 INFO L246 CegarLoopResult]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-11-28 00:01:33,560 INFO L246 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2019-11-28 00:01:33,560 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-28 00:01:33,560 INFO L246 CegarLoopResult]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-11-28 00:01:33,560 INFO L242 CegarLoopResult]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-11-28 00:01:33,560 INFO L242 CegarLoopResult]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse6 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse9 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse6))) (.cse8 (* 4294967296 .cse7)) (.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) .cse0 (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse3 (select .cse5 (+ (* ULTIMATE.start_main_~main__index2~0 4) (* .cse7 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse4 (select .cse5 (+ (* ULTIMATE.start_main_~main__index1~0 4) (* .cse6 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse2 (+ .cse3 (* 4294967296 (div .cse4 4294967296)))) (.cse1 (+ (* 4294967296 (div .cse3 4294967296)) .cse4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse8) .cse9))) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse8 1) .cse9) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse8 99999)) .cse0)))) [2019-11-28 00:01:33,561 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:01:33,561 INFO L249 CegarLoopResult]: At program point L189(lines 9 191) the Hoare annotation is: true [2019-11-28 00:01:33,561 INFO L246 CegarLoopResult]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-11-28 00:01:33,561 INFO L246 CegarLoopResult]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-11-28 00:01:33,561 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-11-28 00:01:33,561 INFO L242 CegarLoopResult]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__index1~0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)) 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))) [2019-11-28 00:01:33,561 INFO L246 CegarLoopResult]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-11-28 00:01:33,562 INFO L242 CegarLoopResult]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (let ((.cse1 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and .cse1 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) .cse2) (and .cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)) .cse2 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))))))) [2019-11-28 00:01:33,563 INFO L246 CegarLoopResult]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-11-28 00:01:33,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:01:33,563 INFO L242 CegarLoopResult]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1))) [2019-11-28 00:01:33,563 INFO L246 CegarLoopResult]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-11-28 00:01:33,563 INFO L246 CegarLoopResult]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-11-28 00:01:33,564 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-11-28 00:01:33,564 INFO L242 CegarLoopResult]: At program point L167(lines 21 180) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-28 00:01:33,564 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-28 00:01:33,564 INFO L246 CegarLoopResult]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-11-28 00:01:33,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:01:33 BoogieIcfgContainer [2019-11-28 00:01:33,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:01:33,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:01:33,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:01:33,597 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:01:33,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:25" (3/4) ... [2019-11-28 00:01:33,607 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:01:33,619 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-28 00:01:33,619 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:01:33,620 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:01:33,692 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:01:33,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:01:33,695 INFO L168 Benchmark]: Toolchain (without parser) took 9209.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 960.4 MB in the beginning and 875.4 MB in the end (delta: 84.9 MB). Peak memory consumption was 234.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:33,699 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:01:33,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:33,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:33,700 INFO L168 Benchmark]: Boogie Preprocessor took 22.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:01:33,701 INFO L168 Benchmark]: RCFGBuilder took 404.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:33,701 INFO L168 Benchmark]: TraceAbstraction took 8263.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.0 MB in the end (delta: 231.8 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:33,702 INFO L168 Benchmark]: Witness Printer took 96.94 ms. Allocated memory is still 1.2 GB. Free memory was 882.0 MB in the beginning and 875.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:33,706 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 404.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8263.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.0 MB in the end (delta: 231.8 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. * Witness Printer took 96.94 ms. Allocated memory is still 1.2 GB. Free memory was 882.0 MB in the beginning and 875.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. 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 - 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: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main____CPAchecker_TMP_0 == 1) && 1 == __VERIFIER_assert__cond) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0))) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(0 == __VERIFIER_assert__cond) && 4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-11-28 00:01:33,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 00:01:33,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1 && 1 == __VERIFIER_assert__cond) && ((4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] <= unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) <= 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) || (((!(0 == __VERIFIER_assert__cond) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && 4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 4 error locations. Result: SAFE, OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 180 SDtfs, 181 SDslu, 202 SDs, 0 SdLazy, 145 SolverSat, 14 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 19 NumberOfFragments, 375 HoareAnnotationTreeSize, 9 FomulaSimplifications, 697 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 113 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 21050 SizeOfPredicates, 2 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...