./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-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 604294306b5c2c89672e57997bbce546f96c9935 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:16:55,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:16:55,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:16:55,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:16:55,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:16:55,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:16:55,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:16:55,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:16:55,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:16:55,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:16:55,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:16:55,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:16:55,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:16:55,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:16:55,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:16:55,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:16:55,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:16:55,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:16:55,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:16:55,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:16:55,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:16:55,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:16:55,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:16:55,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:16:55,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:16:55,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:16:55,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:16:55,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:16:55,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:16:55,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:16:55,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:16:55,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:16:55,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:16:55,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:16:55,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:16:55,504 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:16:55,505 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:16:55,529 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:16:55,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:16:55,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:16:55,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:16:55,531 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:16:55,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:16:55,532 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:16:55,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:16:55,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:16:55,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:16:55,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:16:55,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:16:55,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:16:55,533 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:16:55,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:16:55,535 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:16:55,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:16:55,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:16:55,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:16:55,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:16:55,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:16:55,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:16:55,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:16:55,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:16:55,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:16:55,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:16:55,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:16:55,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:16:55,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 604294306b5c2c89672e57997bbce546f96c9935 [2019-01-12 11:16:55,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:16:55,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:16:55,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:16:55,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:16:55,623 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:16:55,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2019-01-12 11:16:55,688 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff04f8927/4606f70b8df245a08507a44e65ca94af/FLAG2f4e4919c [2019-01-12 11:16:56,103 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:16:56,104 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2019-01-12 11:16:56,111 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff04f8927/4606f70b8df245a08507a44e65ca94af/FLAG2f4e4919c [2019-01-12 11:16:56,456 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff04f8927/4606f70b8df245a08507a44e65ca94af [2019-01-12 11:16:56,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:16:56,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:16:56,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:16:56,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:16:56,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:16:56,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff8549b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56, skipping insertion in model container [2019-01-12 11:16:56,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:16:56,500 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:16:56,726 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:16:56,737 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:16:56,785 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:16:56,817 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:16:56,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56 WrapperNode [2019-01-12 11:16:56,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:16:56,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:16:56,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:16:56,820 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:16:56,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:16:56,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:16:56,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:16:56,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:16:56,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (1/1) ... [2019-01-12 11:16:56,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:16:57,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:16:57,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:16:57,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:16:57,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (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-01-12 11:16:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:16:57,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:16:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 11:16:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 11:16:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 11:16:57,534 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:16:57,535 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:16:57,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:16:57 BoogieIcfgContainer [2019-01-12 11:16:57,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:16:57,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:16:57,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:16:57,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:16:57,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:16:56" (1/3) ... [2019-01-12 11:16:57,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529d8058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:16:57, skipping insertion in model container [2019-01-12 11:16:57,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:56" (2/3) ... [2019-01-12 11:16:57,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529d8058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:16:57, skipping insertion in model container [2019-01-12 11:16:57,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:16:57" (3/3) ... [2019-01-12 11:16:57,547 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2019-01-12 11:16:57,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:16:57,562 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 11:16:57,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 11:16:57,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:16:57,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:16:57,611 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:16:57,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:16:57,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:16:57,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:16:57,612 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:16:57,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:16:57,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:16:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-12 11:16:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:16:57,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:57,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:57,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash -551124073, now seen corresponding path program 1 times [2019-01-12 11:16:57,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:57,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:57,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:16:57,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:16:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:16:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:16:57,832 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-01-12 11:16:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:57,880 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-01-12 11:16:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:16:57,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-12 11:16:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:57,893 INFO L225 Difference]: With dead ends: 46 [2019-01-12 11:16:57,893 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 11:16:57,896 INFO L631 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-01-12 11:16:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 11:16:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-01-12 11:16:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 11:16:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-12 11:16:57,927 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2019-01-12 11:16:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:57,928 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-12 11:16:57,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:16:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-01-12 11:16:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:16:57,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:57,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:57,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2085816175, now seen corresponding path program 1 times [2019-01-12 11:16:57,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:57,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:57,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:57,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:57,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:16:57,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:16:57,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:16:57,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:16:57,978 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-01-12 11:16:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:58,079 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-01-12 11:16:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:16:58,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 11:16:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:58,080 INFO L225 Difference]: With dead ends: 54 [2019-01-12 11:16:58,081 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 11:16:58,082 INFO L631 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-01-12 11:16:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 11:16:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-01-12 11:16:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 11:16:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-12 11:16:58,087 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2019-01-12 11:16:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:58,088 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-12 11:16:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:16:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-01-12 11:16:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:16:58,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:58,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:58,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2019-01-12 11:16:58,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:58,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:58,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:16:58,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:16:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:16:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:16:58,159 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-01-12 11:16:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:58,315 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-01-12 11:16:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:16:58,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-12 11:16:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:58,317 INFO L225 Difference]: With dead ends: 47 [2019-01-12 11:16:58,317 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 11:16:58,318 INFO L631 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-01-12 11:16:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 11:16:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-01-12 11:16:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 11:16:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-12 11:16:58,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2019-01-12 11:16:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:58,326 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-12 11:16:58,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:16:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-12 11:16:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:16:58,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:58,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:58,327 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1997962921, now seen corresponding path program 1 times [2019-01-12 11:16:58,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:58,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:58,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:16:58,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:16:58,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:16:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:16:58,370 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-01-12 11:16:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:58,499 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-01-12 11:16:58,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:16:58,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-12 11:16:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:58,501 INFO L225 Difference]: With dead ends: 50 [2019-01-12 11:16:58,501 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 11:16:58,502 INFO L631 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-01-12 11:16:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 11:16:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-12 11:16:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 11:16:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-12 11:16:58,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2019-01-12 11:16:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:58,510 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-12 11:16:58,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:16:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-01-12 11:16:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:16:58,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:58,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:58,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 588886092, now seen corresponding path program 1 times [2019-01-12 11:16:58,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:58,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:58,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:59,304 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-12 11:17:00,659 WARN L181 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 40 [2019-01-12 11:17:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:17:00,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:00,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 11:17:00,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:17:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:17:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:17:00,822 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 10 states. [2019-01-12 11:17:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:01,417 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-01-12 11:17:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:17:01,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-12 11:17:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:01,420 INFO L225 Difference]: With dead ends: 42 [2019-01-12 11:17:01,421 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 11:17:01,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:17:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 11:17:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-12 11:17:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 11:17:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-12 11:17:01,435 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2019-01-12 11:17:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:01,435 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-12 11:17:01,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:17:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-12 11:17:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 11:17:01,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:01,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:01,439 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:01,441 INFO L82 PathProgramCache]: Analyzing trace with hash 394194232, now seen corresponding path program 1 times [2019-01-12 11:17:01,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:01,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:01,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:17:01,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:01,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:17:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:17:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:17:01,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:17:01,595 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2019-01-12 11:17:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:01,728 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-12 11:17:01,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:17:01,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 11:17:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:01,730 INFO L225 Difference]: With dead ends: 38 [2019-01-12 11:17:01,730 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 11:17:01,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:17:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 11:17:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-12 11:17:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 11:17:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 11:17:01,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2019-01-12 11:17:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:01,738 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 11:17:01,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:17:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 11:17:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 11:17:01,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:01,739 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:01,739 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1016031163, now seen corresponding path program 1 times [2019-01-12 11:17:01,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:01,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:17:02,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:17:02,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-12 11:17:02,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:02,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:17:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:17:02,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:17:02,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-01-12 11:17:02,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:17:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:17:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:17:02,487 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 11:17:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:05,003 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-12 11:17:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:17:05,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-12 11:17:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:05,005 INFO L225 Difference]: With dead ends: 26 [2019-01-12 11:17:05,006 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:17:05,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:17:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:17:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:17:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:17:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:17:05,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-01-12 11:17:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:05,007 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:17:05,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:17:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:17:05,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:17:05,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:17:05,180 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-01-12 11:17:05,291 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-12 11:17:05,470 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-12 11:17:05,561 INFO L451 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-01-12 11:17:05,562 INFO L444 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (let ((.cse6 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse6))) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (< (mod (+ ULTIMATE.start_main_~main__index1~0 4294967295) 4294967296) (mod (+ ULTIMATE.start_main_~main__index2~0 1) 4294967296)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99998)) (let ((.cse7 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse3 (select .cse5 (+ (* 4 ULTIMATE.start_main_~main__index1~0) (* (- 17179869184) .cse7) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse4 (select .cse5 (+ (* 4 ULTIMATE.start_main_~main__index2~0) (* (- 17179869184) .cse6) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse2 (* 4294967296 (div .cse4 4294967296))) (.cse1 (+ .cse4 (* 4294967296 (div .cse3 4294967296))))) (and (< .cse1 (+ .cse2 .cse3 1)) (<= (+ .cse2 .cse3) .cse1))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse7)))))))) (= ULTIMATE.start_main_~main__loop_entered~0 0)) [2019-01-12 11:17:05,563 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-01-12 11:17:05,563 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-01-12 11:17:05,564 INFO L444 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse8 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse9 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse8))) (.cse1 (* 4294967296 .cse7))) (or (and .cse0 (< (mod (+ ULTIMATE.start_main_~main__index1~0 4294967295) 4294967296) (mod (+ ULTIMATE.start_main_~main__index2~0 1) 4294967296)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse1 99998)) (or (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse4 (select .cse6 (+ (* 4 ULTIMATE.start_main_~main__index1~0) (* (- 17179869184) .cse8) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse5 (select .cse6 (+ (* 4 ULTIMATE.start_main_~main__index2~0) (* (- 17179869184) .cse7) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse3 (* 4294967296 (div .cse5 4294967296))) (.cse2 (+ .cse5 (* 4294967296 (div .cse4 4294967296))))) (and (< .cse2 (+ .cse3 .cse4 1)) (<= (+ .cse3 .cse4) .cse2))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse1) .cse9))) (and .cse0 (<= (+ ULTIMATE.start_main_~main__index1~0 .cse1 1) .cse9) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse1 99999)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)))))) [2019-01-12 11:17:05,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-01-12 11:17:05,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-01-12 11:17:05,564 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:17:05,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:17:05,565 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:17:05,565 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-01-12 11:17:05,565 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-01-12 11:17:05,565 INFO L444 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (< (mod (+ ULTIMATE.start_main_~main__index1~0 4294967295) 4294967296) (mod (+ ULTIMATE.start_main_~main__index2~0 1) 4294967296)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99998)) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0)))) [2019-01-12 11:17:05,565 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-01-12 11:17:05,565 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-01-12 11:17:05,566 INFO L444 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse1 (<= (+ ULTIMATE.start_main_~main__index1~0 .cse3 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296))))) (.cse2 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse3 99999)))) (or (and .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) .cse1 .cse2 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~main____CPAchecker_TMP_0~0))))) [2019-01-12 11:17:05,566 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-01-12 11:17:05,566 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 11:17:05,566 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-01-12 11:17:05,566 INFO L451 ceAbstractionStarter]: At program point L161(lines 9 163) the Hoare annotation is: true [2019-01-12 11:17:05,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:17:05,566 INFO L444 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-01-12 11:17:05,567 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-01-12 11:17:05,568 INFO L444 ceAbstractionStarter]: 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-01-12 11:17:05,568 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-01-12 11:17:05,568 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-01-12 11:17:05,568 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-01-12 11:17:05,568 INFO L444 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-01-12 11:17:05,568 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 11:17:05,569 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 11:17:05,569 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-01-12 11:17:05,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:17:05 BoogieIcfgContainer [2019-01-12 11:17:05,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:17:05,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:17:05,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:17:05,617 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:17:05,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:16:57" (3/4) ... [2019-01-12 11:17:05,627 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:17:05,649 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-12 11:17:05,650 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:17:05,725 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:17:05,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:17:05,729 INFO L168 Benchmark]: Toolchain (without parser) took 9269.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 950.0 MB in the beginning and 816.9 MB in the end (delta: 133.1 MB). Peak memory consumption was 264.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,733 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:17:05,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.15 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.25 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,740 INFO L168 Benchmark]: Boogie Preprocessor took 110.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,741 INFO L168 Benchmark]: RCFGBuilder took 536.74 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,742 INFO L168 Benchmark]: TraceAbstraction took 8078.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.6 MB in the end (delta: 271.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,742 INFO L168 Benchmark]: Witness Printer took 112.19 ms. Allocated memory is still 1.2 GB. Free memory was 823.6 MB in the beginning and 816.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:05,751 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.15 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 69.25 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 536.74 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8078.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.6 MB in the end (delta: 271.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.19 ms. Allocated memory is still 1.2 GB. Free memory was 823.6 MB in the beginning and 816.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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 - 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: 105]: 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: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(main____CPAchecker_TMP_0 == 0)) || (((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && 1 == main____CPAchecker_TMP_0) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant [2019-01-12 11:17:05,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((__VERIFIER_assert__cond == 1 && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && ((unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] + 1 && 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] <= unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] / 4294967296)) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-01-12 11:17:05,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:17:05,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((__VERIFIER_assert__cond == 1 && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && ((unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] + 1 && 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] <= unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] / 4294967296)) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) || (((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && !(main____CPAchecker_TMP_0 == 0) - 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: 93]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 3 error locations. SAFE Result, 7.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 190 SDslu, 213 SDs, 0 SdLazy, 206 SolverSat, 18 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 21 NumberOfFragments, 540 HoareAnnotationTreeSize, 9 FomulaSimplifications, 611 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 148 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 19214 SizeOfPredicates, 2 NumberOfNonLiveVariables, 83 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...