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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:03:13,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:03:13,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:03:13,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:03:13,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:03:13,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:03:13,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:03:13,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:03:13,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:03:13,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:03:13,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:03:13,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:03:13,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:03:13,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:03:13,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:03:13,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:03:13,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:03:13,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:03:13,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:03:13,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:03:13,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:03:13,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:03:13,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:03:13,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:03:13,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:03:13,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:03:13,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:03:13,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:03:13,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:03:13,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:03:13,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:03:13,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:03:13,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:03:13,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:03:13,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:03:13,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:03:13,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:03:13,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:03:13,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:03:13,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:03:13,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:03:13,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:03:13,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:03:13,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:03:13,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:03:13,255 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:03:13,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:03:13,256 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:03:13,257 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:03:13,257 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:03:13,257 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:03:13,257 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:03:13,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:03:13,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:03:13,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:03:13,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:03:13,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:03:13,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:03:13,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:03:13,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:03:13,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:03:13,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:03:13,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:03:13,260 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:03:13,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:03:13,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:03:13,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:03:13,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:03:13,261 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:03:13,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:03:13,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:03:13,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:03:13,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:03:13,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:03:13,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:03:13,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:03:13,315 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:03:13,316 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-09-16 17:03:13,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e5614d0/c4d203ca289143afa77147b348bc4d40/FLAGbffc80b08 [2019-09-16 17:03:13,885 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:03:13,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-16 17:03:13,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e5614d0/c4d203ca289143afa77147b348bc4d40/FLAGbffc80b08 [2019-09-16 17:03:14,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e5614d0/c4d203ca289143afa77147b348bc4d40 [2019-09-16 17:03:14,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:03:14,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:03:14,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:14,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:03:14,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:03:14,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55239080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14, skipping insertion in model container [2019-09-16 17:03:14,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,266 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:03:14,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:03:14,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:14,500 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:03:14,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:14,657 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:03:14,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14 WrapperNode [2019-09-16 17:03:14,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:14,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:03:14,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:03:14,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:03:14,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (1/1) ... [2019-09-16 17:03:14,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:03:14,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:03:14,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:03:14,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:03:14,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (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-09-16 17:03:14,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:03:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:03:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:03:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:03:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:03:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 17:03:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-16 17:03:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:03:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:03:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:03:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:03:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:03:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:03:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:03:15,138 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:03:15,138 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 17:03:15,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:15 BoogieIcfgContainer [2019-09-16 17:03:15,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:03:15,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:03:15,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:03:15,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:03:15,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:03:14" (1/3) ... [2019-09-16 17:03:15,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7438bc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:15, skipping insertion in model container [2019-09-16 17:03:15,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:14" (2/3) ... [2019-09-16 17:03:15,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7438bc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:15, skipping insertion in model container [2019-09-16 17:03:15,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:15" (3/3) ... [2019-09-16 17:03:15,156 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-16 17:03:15,163 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:03:15,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-16 17:03:15,188 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-16 17:03:15,211 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:03:15,212 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:03:15,212 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:03:15,212 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:03:15,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:03:15,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:03:15,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:03:15,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:03:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-16 17:03:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-16 17:03:15,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:15,235 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:15,237 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:15,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:15,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-09-16 17:03:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:15,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:15,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:15,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:15,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:15,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:15,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:15,472 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-09-16 17:03:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:15,510 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-16 17:03:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:15,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-16 17:03:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:15,523 INFO L225 Difference]: With dead ends: 42 [2019-09-16 17:03:15,524 INFO L226 Difference]: Without dead ends: 34 [2019-09-16 17:03:15,528 INFO L636 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-09-16 17:03:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-16 17:03:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-16 17:03:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-16 17:03:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-16 17:03:15,572 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-09-16 17:03:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:15,574 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-16 17:03:15,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-16 17:03:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 17:03:15,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:15,577 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:15,578 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-09-16 17:03:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:15,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:15,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:15,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:15,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:15,666 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-09-16 17:03:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:15,721 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-16 17:03:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:15,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-16 17:03:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:15,723 INFO L225 Difference]: With dead ends: 51 [2019-09-16 17:03:15,724 INFO L226 Difference]: Without dead ends: 51 [2019-09-16 17:03:15,725 INFO L636 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-09-16 17:03:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-16 17:03:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-09-16 17:03:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 17:03:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-16 17:03:15,732 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-09-16 17:03:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:15,732 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-16 17:03:15,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-16 17:03:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 17:03:15,733 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:15,733 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:15,734 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:15,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-09-16 17:03:15,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:15,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:15,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:15,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:15,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:15,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:15,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:15,796 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-09-16 17:03:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:15,844 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-16 17:03:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:15,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-16 17:03:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:15,846 INFO L225 Difference]: With dead ends: 41 [2019-09-16 17:03:15,846 INFO L226 Difference]: Without dead ends: 41 [2019-09-16 17:03:15,847 INFO L636 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-09-16 17:03:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-16 17:03:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-09-16 17:03:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 17:03:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-16 17:03:15,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-09-16 17:03:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:15,853 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-16 17:03:15,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-16 17:03:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:15,854 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:15,855 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:15,855 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-09-16 17:03:15,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:15,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:15,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:15,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:15,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:15,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:15,901 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-09-16 17:03:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:15,941 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-16 17:03:15,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:15,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 17:03:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:15,943 INFO L225 Difference]: With dead ends: 35 [2019-09-16 17:03:15,943 INFO L226 Difference]: Without dead ends: 35 [2019-09-16 17:03:15,944 INFO L636 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-09-16 17:03:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-16 17:03:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-16 17:03:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-16 17:03:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-16 17:03:15,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-16 17:03:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:15,949 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-16 17:03:15,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-16 17:03:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:03:15,950 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:15,950 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:15,950 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-09-16 17:03:15,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:15,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:15,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:16,495 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-09-16 17:03:17,086 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-09-16 17:03:17,542 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-09-16 17:03:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:17,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:17,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 17:03:17,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:17,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 17:03:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 17:03:17,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:03:17,566 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-09-16 17:03:18,917 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-09-16 17:03:19,107 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-09-16 17:03:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,893 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-16 17:03:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 17:03:19,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-16 17:03:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,894 INFO L225 Difference]: With dead ends: 31 [2019-09-16 17:03:19,894 INFO L226 Difference]: Without dead ends: 31 [2019-09-16 17:03:19,895 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-16 17:03:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-16 17:03:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-16 17:03:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-16 17:03:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-16 17:03:19,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-09-16 17:03:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,899 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-16 17:03:19,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 17:03:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-16 17:03:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:03:19,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,900 INFO L407 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-09-16 17:03:19,901 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-09-16 17:03:19,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:19,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:19,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:19,977 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-09-16 17:03:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,051 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-16 17:03:20,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:03:20,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-16 17:03:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,054 INFO L225 Difference]: With dead ends: 42 [2019-09-16 17:03:20,054 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 17:03:20,054 INFO L636 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-09-16 17:03:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 17:03:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-09-16 17:03:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-16 17:03:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-16 17:03:20,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-09-16 17:03:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,063 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-16 17:03:20,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-16 17:03:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:03:20,067 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:20,067 INFO L407 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-09-16 17:03:20,067 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-09-16 17:03:20,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:20,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:20,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:20,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-16 17:03:20,293 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2019-09-16 17:03:20,345 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:03:20,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:03:20,456 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:03:20,458 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 0. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-09-16 17:03:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,463 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:03:20,510 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-16 17:03:20,511 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:03:20,515 INFO L420 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-09-16 17:03:20,515 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:03:20,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:03:20,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-16 17:03:20,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:03:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:03:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:03:20,518 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-09-16 17:03:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,520 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-16 17:03:20,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:03:20,521 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-09-16 17:03:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,521 INFO L225 Difference]: With dead ends: 6 [2019-09-16 17:03:20,521 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:03:20,522 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:03:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:03:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:03:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:03:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:03:20,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-16 17:03:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,523 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:03:20,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:03:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:03:20,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:03:20,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:03:20 BoogieIcfgContainer [2019-09-16 17:03:20,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:03:20,532 INFO L168 Benchmark]: Toolchain (without parser) took 6286.04 ms. Allocated memory was 136.8 MB in the beginning and 264.8 MB in the end (delta: 127.9 MB). Free memory was 86.2 MB in the beginning and 185.0 MB in the end (delta: -98.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:20,533 INFO L168 Benchmark]: CDTParser took 1.62 ms. Allocated memory is still 136.8 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:03:20,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.55 ms. Allocated memory was 136.8 MB in the beginning and 198.2 MB in the end (delta: 61.3 MB). Free memory was 86.0 MB in the beginning and 175.1 MB in the end (delta: -89.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:20,537 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 198.2 MB. Free memory was 175.1 MB in the beginning and 173.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:20,538 INFO L168 Benchmark]: RCFGBuilder took 438.43 ms. Allocated memory is still 198.2 MB. Free memory was 172.7 MB in the beginning and 152.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:20,544 INFO L168 Benchmark]: TraceAbstraction took 5383.27 ms. Allocated memory was 198.2 MB in the beginning and 264.8 MB in the end (delta: 66.6 MB). Free memory was 152.8 MB in the beginning and 185.0 MB in the end (delta: -32.2 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:20,551 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62 ms. Allocated memory is still 136.8 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 410.55 ms. Allocated memory was 136.8 MB in the beginning and 198.2 MB in the end (delta: 61.3 MB). Free memory was 86.0 MB in the beginning and 175.1 MB in the end (delta: -89.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 198.2 MB. Free memory was 175.1 MB in the beginning and 173.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 438.43 ms. Allocated memory is still 198.2 MB. Free memory was 172.7 MB in the beginning and 152.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5383.27 ms. Allocated memory was 198.2 MB in the beginning and 264.8 MB in the end (delta: 66.6 MB). Free memory was 152.8 MB in the beginning and 185.0 MB in the end (delta: -32.2 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 5.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 157 SDslu, 258 SDs, 0 SdLazy, 110 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s 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.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9772727272727273 AbsIntWeakeningRatio, 1.4545454545454546 AbsIntAvgWeakeningVarsNumRemoved, 0.9545454545454546 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 53974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...