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/eca-rers2012/Problem02_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:19:29,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:19:29,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:19:29,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:19:29,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:19:29,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:19:29,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:19:29,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:19:29,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:19:29,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:19:29,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:19:29,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:19:29,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:19:29,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:19:29,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:19:29,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:19:29,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:19:29,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:19:29,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:19:29,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:19:29,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:19:29,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:19:29,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:19:29,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:19:30,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:19:30,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:19:30,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:19:30,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:19:30,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:19:30,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:19:30,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:19:30,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:19:30,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:19:30,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:19:30,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:19:30,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:19:30,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:19:30,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:19:30,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:19:30,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:19:30,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:19:30,016 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-10-02 17:19:30,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:19:30,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:19:30,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:19:30,047 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:19:30,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:19:30,048 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:19:30,049 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:19:30,049 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:19:30,050 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:19:30,050 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:19:30,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:19:30,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:19:30,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:19:30,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:19:30,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:19:30,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:19:30,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:19:30,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:19:30,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:19:30,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:19:30,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:19:30,054 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:19:30,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:19:30,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:19:30,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:19:30,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:19:30,055 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:19:30,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:19:30,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:19:30,055 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:19:30,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:19:30,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:19:30,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:19:30,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:19:30,122 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:19:30,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label13.c [2019-10-02 17:19:30,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3005d6cbd/4aabd877e9d04ea993eeb1d389c1833c/FLAG4d8351aba [2019-10-02 17:19:30,788 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:19:30,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label13.c [2019-10-02 17:19:30,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3005d6cbd/4aabd877e9d04ea993eeb1d389c1833c/FLAG4d8351aba [2019-10-02 17:19:31,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3005d6cbd/4aabd877e9d04ea993eeb1d389c1833c [2019-10-02 17:19:31,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:19:31,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:19:31,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:19:31,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:19:31,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:19:31,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:31,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f898ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31, skipping insertion in model container [2019-10-02 17:19:31,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:31,129 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:19:31,175 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:19:31,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:19:31,836 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:19:31,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:19:31,964 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:19:31,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31 WrapperNode [2019-10-02 17:19:31,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:19:31,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:19:31,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:19:31,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:19:31,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:31,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:32,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:32,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:32,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:32,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:32,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (1/1) ... [2019-10-02 17:19:32,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:19:32,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:19:32,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:19:32,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:19:32,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (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 17:19:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:19:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:19:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:19:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:19:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:19:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:19:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:19:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:19:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:19:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:19:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:19:33,436 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:19:33,436 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:19:33,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:19:33 BoogieIcfgContainer [2019-10-02 17:19:33,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:19:33,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:19:33,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:19:33,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:19:33,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:19:31" (1/3) ... [2019-10-02 17:19:33,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee4f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:19:33, skipping insertion in model container [2019-10-02 17:19:33,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:31" (2/3) ... [2019-10-02 17:19:33,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee4f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:19:33, skipping insertion in model container [2019-10-02 17:19:33,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:19:33" (3/3) ... [2019-10-02 17:19:33,448 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label13.c [2019-10-02 17:19:33,458 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:19:33,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:19:33,487 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:19:33,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:19:33,526 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:19:33,526 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:19:33,526 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:19:33,527 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:19:33,527 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:19:33,527 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:19:33,527 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:19:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:19:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 17:19:33,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:33,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:33,579 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash -807098266, now seen corresponding path program 1 times [2019-10-02 17:19:33,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:33,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:34,074 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 17:19:34,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:34,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:19:34,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:34,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:19:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:19:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:19:34,104 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:19:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:35,199 INFO L93 Difference]: Finished difference Result 385 states and 567 transitions. [2019-10-02 17:19:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:19:35,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-02 17:19:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:35,218 INFO L225 Difference]: With dead ends: 385 [2019-10-02 17:19:35,218 INFO L226 Difference]: Without dead ends: 317 [2019-10-02 17:19:35,220 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 17:19:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-02 17:19:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-10-02 17:19:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-10-02 17:19:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 478 transitions. [2019-10-02 17:19:35,300 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 478 transitions. Word has length 92 [2019-10-02 17:19:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:35,301 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 478 transitions. [2019-10-02 17:19:35,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:19:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 478 transitions. [2019-10-02 17:19:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 17:19:35,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:35,308 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:35,309 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1142863243, now seen corresponding path program 1 times [2019-10-02 17:19:35,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:35,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:35,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:35,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:19:35,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:35,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:19:35,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:19:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:19:35,496 INFO L87 Difference]: Start difference. First operand 317 states and 478 transitions. Second operand 6 states. [2019-10-02 17:19:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:35,980 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2019-10-02 17:19:35,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 17:19:35,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-10-02 17:19:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:35,984 INFO L225 Difference]: With dead ends: 314 [2019-10-02 17:19:35,985 INFO L226 Difference]: Without dead ends: 314 [2019-10-02 17:19:35,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 17:19:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-02 17:19:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2019-10-02 17:19:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-02 17:19:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2019-10-02 17:19:36,030 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 107 [2019-10-02 17:19:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:36,033 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2019-10-02 17:19:36,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:19:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2019-10-02 17:19:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 17:19:36,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:36,041 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:36,042 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1161387902, now seen corresponding path program 1 times [2019-10-02 17:19:36,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:36,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:36,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:36,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:19:36,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:36,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:19:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:19:36,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:19:36,225 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand 6 states. [2019-10-02 17:19:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:37,084 INFO L93 Difference]: Finished difference Result 478 states and 665 transitions. [2019-10-02 17:19:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:19:37,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-10-02 17:19:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:37,089 INFO L225 Difference]: With dead ends: 478 [2019-10-02 17:19:37,089 INFO L226 Difference]: Without dead ends: 478 [2019-10-02 17:19:37,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:19:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-02 17:19:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 461. [2019-10-02 17:19:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-02 17:19:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 632 transitions. [2019-10-02 17:19:37,120 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 632 transitions. Word has length 114 [2019-10-02 17:19:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:37,121 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 632 transitions. [2019-10-02 17:19:37,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:19:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 632 transitions. [2019-10-02 17:19:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 17:19:37,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:37,124 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:37,124 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1182299638, now seen corresponding path program 1 times [2019-10-02 17:19:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:37,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:37,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:37,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:19:37,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:37,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:19:37,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:19:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:19:37,263 INFO L87 Difference]: Start difference. First operand 461 states and 632 transitions. Second operand 3 states. [2019-10-02 17:19:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:37,783 INFO L93 Difference]: Finished difference Result 757 states and 964 transitions. [2019-10-02 17:19:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:19:37,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-10-02 17:19:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:37,789 INFO L225 Difference]: With dead ends: 757 [2019-10-02 17:19:37,789 INFO L226 Difference]: Without dead ends: 757 [2019-10-02 17:19:37,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 17:19:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-10-02 17:19:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2019-10-02 17:19:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-10-02 17:19:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 964 transitions. [2019-10-02 17:19:37,831 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 964 transitions. Word has length 118 [2019-10-02 17:19:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:37,831 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 964 transitions. [2019-10-02 17:19:37,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:19:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 964 transitions. [2019-10-02 17:19:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 17:19:37,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:37,836 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:37,836 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1745080665, now seen corresponding path program 1 times [2019-10-02 17:19:37,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:37,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:37,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:37,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:19:37,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:19:37,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-10-02 17:19:37,970 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [415], [417], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:19:38,025 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:19:38,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:30:20,064 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:30:20,067 INFO L272 AbstractInterpreter]: Visited 96 different actions 280 times. Merged at 6 different actions 12 times. Never widened. Performed 733 root evaluator evaluations with a maximum evaluation depth of 18. Performed 733 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2019-10-02 17:30:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:30:20,072 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:33:43,258 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 80.4% of their original sizes. [2019-10-02 17:33:43,259 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:33:43,342 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-10-02 17:33:43,342 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:33:43,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:33:43,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2019-10-02 17:33:43,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:33:43,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 17:33:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 17:33:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 17:33:43,345 INFO L87 Difference]: Start difference. First operand 757 states and 964 transitions. Second operand 10 states. [2019-10-02 17:33:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:33:56,066 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~a25~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:708) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:637) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 17:33:56,073 INFO L168 Benchmark]: Toolchain (without parser) took 864961.77 ms. Allocated memory was 132.1 MB in the beginning and 355.5 MB in the end (delta: 223.3 MB). Free memory was 86.1 MB in the beginning and 186.2 MB in the end (delta: -100.2 MB). Peak memory consumption was 123.2 MB. Max. memory is 7.1 GB. [2019-10-02 17:33:56,074 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 17:33:56,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.88 ms. Allocated memory was 132.1 MB in the beginning and 200.8 MB in the end (delta: 68.7 MB). Free memory was 86.1 MB in the beginning and 158.4 MB in the end (delta: -72.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-10-02 17:33:56,076 INFO L168 Benchmark]: Boogie Preprocessor took 151.81 ms. Allocated memory is still 200.8 MB. Free memory was 158.4 MB in the beginning and 153.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-10-02 17:33:56,077 INFO L168 Benchmark]: RCFGBuilder took 1321.48 ms. Allocated memory was 200.8 MB in the beginning and 222.8 MB in the end (delta: 22.0 MB). Free memory was 153.8 MB in the beginning and 168.7 MB in the end (delta: -14.9 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2019-10-02 17:33:56,079 INFO L168 Benchmark]: TraceAbstraction took 862629.99 ms. Allocated memory was 222.8 MB in the beginning and 355.5 MB in the end (delta: 132.6 MB). Free memory was 167.1 MB in the beginning and 186.2 MB in the end (delta: -19.1 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2019-10-02 17:33:56,086 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.21 ms. Allocated memory is still 132.1 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.88 ms. Allocated memory was 132.1 MB in the beginning and 200.8 MB in the end (delta: 68.7 MB). Free memory was 86.1 MB in the beginning and 158.4 MB in the end (delta: -72.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.81 ms. Allocated memory is still 200.8 MB. Free memory was 158.4 MB in the beginning and 153.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1321.48 ms. Allocated memory was 200.8 MB in the beginning and 222.8 MB in the end (delta: 22.0 MB). Free memory was 153.8 MB in the beginning and 168.7 MB in the end (delta: -14.9 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 862629.99 ms. Allocated memory was 222.8 MB in the beginning and 355.5 MB in the end (delta: 132.6 MB). Free memory was 167.1 MB in the beginning and 186.2 MB in the end (delta: -19.1 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~a25~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~a25~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...