java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:15:54,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:15:54,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:15:54,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:15:54,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:15:54,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:15:54,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:15:54,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:15:54,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:15:54,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:15:54,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:15:54,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:15:54,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:15:54,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:15:54,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:15:54,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:15:54,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:15:54,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:15:54,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:15:54,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:15:54,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:15:54,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:15:54,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:15:54,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:15:54,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:15:54,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:15:54,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:15:54,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:15:54,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:15:54,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:15:54,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:15:54,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:15:54,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:15:54,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:15:54,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:15:54,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:15:54,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:15:54,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:15:54,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:15:54,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:15:54,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:15:54,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:15:54,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:15:54,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:15:54,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:15:54,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:15:54,157 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:15:54,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:15:54,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:15:54,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:15:54,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:15:54,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:15:54,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:15:54,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:15:54,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:15:54,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:15:54,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:15:54,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:15:54,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:15:54,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:15:54,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:15:54,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:15:54,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:15:54,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:15:54,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:15:54,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:15:54,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:15:54,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:15:54,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:15:54,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:15:54,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:15:54,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:15:54,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:15:54,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:15:54,207 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:15:54,207 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:15:54,208 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-02 11:15:54,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8f87b09/6f6eba9e7f4640efa11bc1a73a0de540/FLAGc8251d26c [2019-10-02 11:15:54,683 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:15:54,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-02 11:15:54,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8f87b09/6f6eba9e7f4640efa11bc1a73a0de540/FLAGc8251d26c [2019-10-02 11:15:55,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8f87b09/6f6eba9e7f4640efa11bc1a73a0de540 [2019-10-02 11:15:55,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:15:55,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:15:55,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:15:55,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:15:55,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:15:55,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472088b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55, skipping insertion in model container [2019-10-02 11:15:55,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:15:55,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:15:55,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:15:55,354 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:15:55,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:15:55,503 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:15:55,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55 WrapperNode [2019-10-02 11:15:55,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:15:55,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:15:55,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:15:55,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:15:55,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (1/1) ... [2019-10-02 11:15:55,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:15:55,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:15:55,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:15:55,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:15:55,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (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-10-02 11:15:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:15:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:15:55,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:15:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:15:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:15:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:15:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:15:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:15:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:15:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:15:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:15:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:15:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:15:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:15:55,957 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:15:55,957 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:15:55,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:15:55 BoogieIcfgContainer [2019-10-02 11:15:55,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:15:55,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:15:55,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:15:55,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:15:55,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:15:55" (1/3) ... [2019-10-02 11:15:55,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e62098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:15:55, skipping insertion in model container [2019-10-02 11:15:55,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:15:55" (2/3) ... [2019-10-02 11:15:55,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e62098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:15:55, skipping insertion in model container [2019-10-02 11:15:55,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:15:55" (3/3) ... [2019-10-02 11:15:55,966 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-02 11:15:55,975 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:15:55,982 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-02 11:15:55,998 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-02 11:15:56,030 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:15:56,031 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:15:56,031 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:15:56,031 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:15:56,032 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:15:56,032 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:15:56,032 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:15:56,032 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:15:56,032 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:15:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-02 11:15:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:15:56,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:56,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:56,056 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-10-02 11:15:56,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:56,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:15:56,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:15:56,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:15:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:15:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:15:56,294 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-10-02 11:15:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:56,351 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-10-02 11:15:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:15:56,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 11:15:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:56,366 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:15:56,366 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 11:15:56,370 INFO L640 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-10-02 11:15:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 11:15:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-02 11:15:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 11:15:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-02 11:15:56,419 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-10-02 11:15:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:56,420 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-02 11:15:56,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:15:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-02 11:15:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:15:56,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:56,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:56,422 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-10-02 11:15:56,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:56,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:56,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:15:56,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:15:56,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:15:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:15:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:15:56,520 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-10-02 11:15:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:56,592 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-10-02 11:15:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:15:56,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-02 11:15:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:56,594 INFO L225 Difference]: With dead ends: 53 [2019-10-02 11:15:56,595 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 11:15:56,596 INFO L640 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-10-02 11:15:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 11:15:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-10-02 11:15:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 11:15:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-02 11:15:56,609 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-10-02 11:15:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:56,610 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-02 11:15:56,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:15:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-02 11:15:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:15:56,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:56,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:56,615 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:56,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-10-02 11:15:56,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:56,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:56,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:56,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:15:56,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:15:56,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:15:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:15:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:15:56,685 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-10-02 11:15:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:56,731 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-02 11:15:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:15:56,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 11:15:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:56,734 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:15:56,734 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 11:15:56,735 INFO L640 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-10-02 11:15:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 11:15:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-10-02 11:15:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 11:15:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-02 11:15:56,741 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-10-02 11:15:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:56,741 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-02 11:15:56,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:15:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-02 11:15:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:15:56,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:56,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:56,743 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-10-02 11:15:56,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:56,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:56,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:15:56,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:15:56,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:15:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:15:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:15:56,783 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-10-02 11:15:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:56,825 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-02 11:15:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:15:56,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 11:15:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:56,826 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:15:56,826 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 11:15:56,827 INFO L640 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-10-02 11:15:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 11:15:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-02 11:15:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:15:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-02 11:15:56,832 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-10-02 11:15:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:56,832 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-02 11:15:56,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:15:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-02 11:15:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:15:56,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:56,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:56,834 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-10-02 11:15:56,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:56,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:57,863 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-10-02 11:15:58,315 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-10-02 11:15:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:58,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:15:58,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:15:58,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:15:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:15:58,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:15:58,341 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-10-02 11:15:58,592 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-10-02 11:15:58,771 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-10-02 11:15:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:58,811 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-02 11:15:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:15:58,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-02 11:15:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:58,813 INFO L225 Difference]: With dead ends: 47 [2019-10-02 11:15:58,813 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 11:15:58,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:15:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 11:15:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-02 11:15:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 11:15:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-02 11:15:58,819 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-10-02 11:15:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:58,819 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-02 11:15:58,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:15:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-02 11:15:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:15:58,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:58,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:58,821 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-10-02 11:15:58,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:58,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:58,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:15:58,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:15:58,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:15:58,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:15:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:15:58,868 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-10-02 11:15:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:58,937 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-02 11:15:58,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:15:58,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-02 11:15:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:58,939 INFO L225 Difference]: With dead ends: 44 [2019-10-02 11:15:58,940 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:15:58,940 INFO L640 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-10-02 11:15:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:15:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-10-02 11:15:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 11:15:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-02 11:15:58,945 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-10-02 11:15:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:58,945 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-02 11:15:58,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:15:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-02 11:15:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:15:58,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:58,947 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:58,947 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-10-02 11:15:58,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:58,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:59,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:59,106 INFO L224 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-10-02 11:15:59,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:15:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:59,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:15:59,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:15:59,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:15:59,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-10-02 11:15:59,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:15:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:15:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:15:59,465 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-10-02 11:16:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:00,021 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-10-02 11:16:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:16:00,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-02 11:16:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:00,024 INFO L225 Difference]: With dead ends: 32 [2019-10-02 11:16:00,024 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:16:00,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:16:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:16:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:16:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:16:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:16:00,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-02 11:16:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:00,025 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:16:00,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:16:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:16:00,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:16:00,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:16:00,551 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-02 11:16:02,837 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-10-02 11:16:02,960 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-10-02 11:16:02,963 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:16:02,963 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:16:02,963 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:16:02,963 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:16:02,964 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:16:02,964 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:16:02,964 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:16:02,964 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-10-02 11:16:02,964 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-10-02 11:16:02,964 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-10-02 11:16:02,964 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-10-02 11:16:02,964 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-10-02 11:16:02,965 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse7 (div main_~main__index1~0 4294967296)) (.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (* 4294967296 .cse6)) (.cse9 (+ (* 4294967296 .cse7) main_~main__index2~0))) (or (and (<= (+ (* 4294967296 (div (+ (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)) main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) 1) main_~main__index1~0) .cse0 (or (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ (* (- 17179869184) .cse7) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse5 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse6))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse2 4294967296)))) (.cse1 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ main_~main__index1~0 .cse8) .cse9))) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse8 1) .cse9))))) [2019-10-02 11:16:02,965 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-10-02 11:16:02,965 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-10-02 11:16:02,965 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-10-02 11:16:02,965 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-10-02 11:16:02,966 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-10-02 11:16:02,966 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-02 11:16:02,966 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= (+ (* 4294967296 (div (+ (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)) main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) 1) main_~main__index1~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) [2019-10-02 11:16:02,966 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-10-02 11:16:02,966 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-10-02 11:16:02,966 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse0 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2)))) [2019-10-02 11:16:02,966 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 11:16:02,967 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-10-02 11:16:02,967 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-10-02 11:16:02,967 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-10-02 11:16:02,967 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-10-02 11:16:02,967 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2019-10-02 11:16:02,967 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-10-02 11:16:02,967 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-10-02 11:16:02,967 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-02 11:16:02,968 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2019-10-02 11:16:02,968 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-10-02 11:16:02,968 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-10-02 11:16:02,968 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-10-02 11:16:02,968 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-10-02 11:16:02,968 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-10-02 11:16:02,968 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-10-02 11:16:02,969 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (<= (+ (* 4294967296 (div (+ (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)) main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) 1) main_~main__index1~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2019-10-02 11:16:02,969 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-02 11:16:02,969 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-10-02 11:16:02,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:02,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:16:02 BoogieIcfgContainer [2019-10-02 11:16:02,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:16:02,996 INFO L168 Benchmark]: Toolchain (without parser) took 7886.56 ms. Allocated memory was 137.4 MB in the beginning and 269.0 MB in the end (delta: 131.6 MB). Free memory was 84.8 MB in the beginning and 136.8 MB in the end (delta: -52.0 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:16:02,996 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:16:02,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.39 ms. Allocated memory was 137.4 MB in the beginning and 197.7 MB in the end (delta: 60.3 MB). Free memory was 84.3 MB in the beginning and 174.8 MB in the end (delta: -90.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:16:02,998 INFO L168 Benchmark]: Boogie Preprocessor took 39.06 ms. Allocated memory is still 197.7 MB. Free memory was 174.8 MB in the beginning and 172.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:16:02,999 INFO L168 Benchmark]: RCFGBuilder took 414.16 ms. Allocated memory is still 197.7 MB. Free memory was 172.9 MB in the beginning and 152.4 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:16:03,000 INFO L168 Benchmark]: TraceAbstraction took 7034.26 ms. Allocated memory was 197.7 MB in the beginning and 269.0 MB in the end (delta: 71.3 MB). Free memory was 152.4 MB in the beginning and 136.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:16:03,004 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.39 ms. Allocated memory was 137.4 MB in the beginning and 197.7 MB in the end (delta: 60.3 MB). Free memory was 84.3 MB in the beginning and 174.8 MB in the end (delta: -90.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.06 ms. Allocated memory is still 197.7 MB. Free memory was 174.8 MB in the beginning and 172.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 414.16 ms. Allocated memory is still 197.7 MB. Free memory was 172.9 MB in the beginning and 152.4 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7034.26 ms. Allocated memory was 197.7 MB in the beginning and 269.0 MB in the end (delta: 71.3 MB). Free memory was 152.4 MB in the beginning and 136.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 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: 104]: 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: 162]: 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: 21]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && 4294967296 * ((4294967296 * ((main__index2 + 4294867297) / 4294967296) + main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + 1 <= main__index1) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-10-02 11:16:03,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:16:03,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((4294967296 * ((main__index2 + 4294867297) / 4294967296) + main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + 1 <= main__index1 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((4294967296 * ((4294967296 * ((main__index2 + 4294867297) / 4294967296) + main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + 1 <= main__index1 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 6.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 188 SDslu, 279 SDs, 0 SdLazy, 145 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 394 HoareAnnotationTreeSize, 12 FomulaSimplifications, 665 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 128 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 58858 SizeOfPredicates, 2 NumberOfNonLiveVariables, 117 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...