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_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 07:06:08,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 07:06:08,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 07:06:08,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 07:06:08,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 07:06:08,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 07:06:08,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 07:06:08,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 07:06:08,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 07:06:08,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 07:06:08,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 07:06:08,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 07:06:08,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 07:06:08,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 07:06:08,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 07:06:08,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 07:06:08,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 07:06:08,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 07:06:08,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 07:06:08,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 07:06:08,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 07:06:08,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 07:06:08,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 07:06:08,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 07:06:08,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 07:06:08,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 07:06:08,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 07:06:08,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 07:06:08,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 07:06:08,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 07:06:08,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 07:06:08,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 07:06:08,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 07:06:08,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 07:06:08,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 07:06:08,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 07:06:08,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 07:06:08,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 07:06:08,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 07:06:08,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 07:06:08,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 07:06:08,077 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-09 07:06:08,092 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 07:06:08,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 07:06:08,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 07:06:08,095 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 07:06:08,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 07:06:08,095 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 07:06:08,096 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 07:06:08,096 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 07:06:08,096 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 07:06:08,096 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 07:06:08,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 07:06:08,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 07:06:08,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 07:06:08,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 07:06:08,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 07:06:08,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 07:06:08,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 07:06:08,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 07:06:08,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 07:06:08,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 07:06:08,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 07:06:08,099 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 07:06:08,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 07:06:08,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 07:06:08,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 07:06:08,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 07:06:08,102 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 07:06:08,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 07:06:08,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 07:06:08,102 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 07:06:08,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 07:06:08,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 07:06:08,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 07:06:08,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 07:06:08,157 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 07:06:08,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-09-09 07:06:08,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dd4329a/98edc963d1bf43ae97ff02fd31b58f67/FLAG86bb82cb0 [2019-09-09 07:06:08,755 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 07:06:08,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-09-09 07:06:08,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dd4329a/98edc963d1bf43ae97ff02fd31b58f67/FLAG86bb82cb0 [2019-09-09 07:06:09,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dd4329a/98edc963d1bf43ae97ff02fd31b58f67 [2019-09-09 07:06:09,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 07:06:09,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 07:06:09,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 07:06:09,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 07:06:09,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 07:06:09,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fc2b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09, skipping insertion in model container [2019-09-09 07:06:09,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,046 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 07:06:09,108 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 07:06:09,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 07:06:09,631 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 07:06:09,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 07:06:09,745 INFO L192 MainTranslator]: Completed translation [2019-09-09 07:06:09,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09 WrapperNode [2019-09-09 07:06:09,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 07:06:09,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 07:06:09,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 07:06:09,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 07:06:09,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (1/1) ... [2019-09-09 07:06:09,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 07:06:09,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 07:06:09,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 07:06:09,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 07:06:09,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (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-09 07:06:09,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 07:06:09,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 07:06:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 07:06:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 07:06:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 07:06:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 07:06:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 07:06:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 07:06:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 07:06:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 07:06:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 07:06:11,105 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 07:06:11,105 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 07:06:11,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:06:11 BoogieIcfgContainer [2019-09-09 07:06:11,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 07:06:11,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 07:06:11,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 07:06:11,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 07:06:11,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 07:06:09" (1/3) ... [2019-09-09 07:06:11,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:06:11, skipping insertion in model container [2019-09-09 07:06:11,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:06:09" (2/3) ... [2019-09-09 07:06:11,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:06:11, skipping insertion in model container [2019-09-09 07:06:11,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:06:11" (3/3) ... [2019-09-09 07:06:11,115 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label53.c [2019-09-09 07:06:11,124 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 07:06:11,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 07:06:11,150 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 07:06:11,177 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 07:06:11,177 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 07:06:11,177 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 07:06:11,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 07:06:11,178 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 07:06:11,178 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 07:06:11,178 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 07:06:11,178 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 07:06:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-09 07:06:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 07:06:11,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:11,233 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:11,235 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1422395146, now seen corresponding path program 1 times [2019-09-09 07:06:11,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:11,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:11,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:11,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:11,834 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-09 07:06:11,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:11,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 07:06:11,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:11,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 07:06:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 07:06:11,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:06:11,865 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-09-09 07:06:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:12,777 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-09-09 07:06:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 07:06:12,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-09 07:06:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:12,794 INFO L225 Difference]: With dead ends: 388 [2019-09-09 07:06:12,795 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:06:12,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:06:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:06:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:06:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:06:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-09-09 07:06:12,870 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 144 [2019-09-09 07:06:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:12,871 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-09-09 07:06:12,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 07:06:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-09-09 07:06:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 07:06:12,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:12,877 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:12,877 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 339587089, now seen corresponding path program 1 times [2019-09-09 07:06:12,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:12,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:12,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:12,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:12,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:13,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:13,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:06:13,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:13,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:06:13,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:06:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:06:13,148 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-09-09 07:06:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:13,801 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-09-09 07:06:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:06:13,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-09-09 07:06:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:13,806 INFO L225 Difference]: With dead ends: 407 [2019-09-09 07:06:13,806 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:06:13,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 07:06:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:06:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:06:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:06:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-09-09 07:06:13,841 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 152 [2019-09-09 07:06:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:13,842 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-09-09 07:06:13,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:06:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-09-09 07:06:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 07:06:13,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:13,846 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:13,846 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -84143163, now seen corresponding path program 1 times [2019-09-09 07:06:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:13,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:14,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:14,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:06:14,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:14,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:06:14,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:06:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:06:14,225 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-09-09 07:06:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:14,921 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-09-09 07:06:14,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:06:14,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-09 07:06:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:14,944 INFO L225 Difference]: With dead ends: 403 [2019-09-09 07:06:14,945 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:06:14,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 07:06:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:06:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:06:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:06:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-09-09 07:06:14,958 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 158 [2019-09-09 07:06:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:14,959 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-09-09 07:06:14,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:06:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-09-09 07:06:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 07:06:14,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:14,962 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:14,963 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash 284152846, now seen corresponding path program 1 times [2019-09-09 07:06:14,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:14,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:14,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:15,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:15,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 07:06:15,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:15,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 07:06:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 07:06:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 07:06:15,109 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-09-09 07:06:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:16,028 INFO L93 Difference]: Finished difference Result 637 states and 893 transitions. [2019-09-09 07:06:16,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 07:06:16,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-09-09 07:06:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:16,034 INFO L225 Difference]: With dead ends: 637 [2019-09-09 07:06:16,034 INFO L226 Difference]: Without dead ends: 637 [2019-09-09 07:06:16,035 INFO L628 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-09-09 07:06:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-09 07:06:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-09-09 07:06:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-09 07:06:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-09-09 07:06:16,060 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 166 [2019-09-09 07:06:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:16,061 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-09-09 07:06:16,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 07:06:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-09-09 07:06:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 07:06:16,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:16,065 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:16,065 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2061838006, now seen corresponding path program 1 times [2019-09-09 07:06:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:16,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:16,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:16,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:06:16,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:16,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:06:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:06:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:06:16,307 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-09-09 07:06:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:16,952 INFO L93 Difference]: Finished difference Result 710 states and 956 transitions. [2019-09-09 07:06:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:06:16,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-09 07:06:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:16,959 INFO L225 Difference]: With dead ends: 710 [2019-09-09 07:06:16,959 INFO L226 Difference]: Without dead ends: 626 [2019-09-09 07:06:16,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 07:06:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-09 07:06:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-09 07:06:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-09 07:06:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-09-09 07:06:16,978 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 168 [2019-09-09 07:06:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:16,978 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-09-09 07:06:16,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:06:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-09-09 07:06:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 07:06:16,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:16,982 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:16,983 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2138250886, now seen corresponding path program 1 times [2019-09-09 07:06:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:16,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:17,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:17,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:06:17,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:17,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:06:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:06:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:06:17,192 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-09-09 07:06:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:17,831 INFO L93 Difference]: Finished difference Result 712 states and 946 transitions. [2019-09-09 07:06:17,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:06:17,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-09-09 07:06:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:17,836 INFO L225 Difference]: With dead ends: 712 [2019-09-09 07:06:17,836 INFO L226 Difference]: Without dead ends: 626 [2019-09-09 07:06:17,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 07:06:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-09 07:06:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-09 07:06:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-09 07:06:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-09-09 07:06:17,853 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 170 [2019-09-09 07:06:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:17,853 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-09-09 07:06:17,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:06:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-09-09 07:06:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-09 07:06:17,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:17,857 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:17,857 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 23816446, now seen corresponding path program 1 times [2019-09-09 07:06:17,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:17,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:17,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:17,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:06:17,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 07:06:17,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:06:17,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 07:06:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 07:06:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 07:06:17,943 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-09-09 07:06:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:06:18,757 INFO L93 Difference]: Finished difference Result 1238 states and 1701 transitions. [2019-09-09 07:06:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 07:06:18,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-09-09 07:06:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:06:18,765 INFO L225 Difference]: With dead ends: 1238 [2019-09-09 07:06:18,765 INFO L226 Difference]: Without dead ends: 1238 [2019-09-09 07:06:18,766 INFO L628 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-09-09 07:06:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-09-09 07:06:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-09-09 07:06:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-09 07:06:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1634 transitions. [2019-09-09 07:06:18,803 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1634 transitions. Word has length 174 [2019-09-09 07:06:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:06:18,804 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1634 transitions. [2019-09-09 07:06:18,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 07:06:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1634 transitions. [2019-09-09 07:06:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-09 07:06:18,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:06:18,810 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-09-09 07:06:18,810 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:06:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:06:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 141476734, now seen corresponding path program 1 times [2019-09-09 07:06:18,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:06:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:18,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:06:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:06:18,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:06:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:06:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:06:18,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 07:06:18,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 07:06:18,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2019-09-09 07:06:18,915 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [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], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [831], [833], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-09-09 07:06:18,964 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 07:06:18,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 07:13:16,039 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 07:13:16,042 INFO L272 AbstractInterpreter]: Visited 148 different actions 290 times. Merged at 4 different actions 4 times. Never widened. Performed 577 root evaluator evaluations with a maximum evaluation depth of 18. Performed 577 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2019-09-09 07:13:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:13:16,046 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 07:18:50,692 INFO L227 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 81.17% of their original sizes. [2019-09-09 07:18:50,693 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 07:18:50,876 INFO L420 sIntCurrentIteration]: We unified 207 AI predicates to 207 [2019-09-09 07:18:50,876 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 07:18:50,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 07:18:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-09-09 07:18:50,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:18:50,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-09 07:18:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-09 07:18:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-09-09 07:18:50,879 INFO L87 Difference]: Start difference. First operand 1218 states and 1634 transitions. Second operand 16 states. [2019-09-09 07:19:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 07:19:18,278 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:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) 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-09-09 07:19:18,285 INFO L168 Benchmark]: Toolchain (without parser) took 789259.59 ms. Allocated memory was 141.6 MB in the beginning and 295.2 MB in the end (delta: 153.6 MB). Free memory was 86.7 MB in the beginning and 127.3 MB in the end (delta: -40.6 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. [2019-09-09 07:19:18,285 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 141.6 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 07:19:18,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.66 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 86.3 MB in the beginning and 169.9 MB in the end (delta: -83.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-09-09 07:19:18,287 INFO L168 Benchmark]: Boogie Preprocessor took 111.27 ms. Allocated memory is still 203.9 MB. Free memory was 169.9 MB in the beginning and 165.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-09-09 07:19:18,288 INFO L168 Benchmark]: RCFGBuilder took 1248.81 ms. Allocated memory was 203.9 MB in the beginning and 232.3 MB in the end (delta: 28.3 MB). Free memory was 165.2 MB in the beginning and 183.4 MB in the end (delta: -18.1 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. [2019-09-09 07:19:18,289 INFO L168 Benchmark]: TraceAbstraction took 787174.51 ms. Allocated memory was 232.3 MB in the beginning and 295.2 MB in the end (delta: 62.9 MB). Free memory was 183.4 MB in the beginning and 127.3 MB in the end (delta: 56.1 MB). Peak memory consumption was 119.0 MB. Max. memory is 7.1 GB. [2019-09-09 07:19:18,293 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.16 ms. Allocated memory is still 141.6 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.66 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 86.3 MB in the beginning and 169.9 MB in the end (delta: -83.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.27 ms. Allocated memory is still 203.9 MB. Free memory was 169.9 MB in the beginning and 165.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1248.81 ms. Allocated memory was 203.9 MB in the beginning and 232.3 MB in the end (delta: 28.3 MB). Free memory was 165.2 MB in the beginning and 183.4 MB in the end (delta: -18.1 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 787174.51 ms. Allocated memory was 232.3 MB in the beginning and 295.2 MB in the end (delta: 62.9 MB). Free memory was 183.4 MB in the beginning and 127.3 MB in the end (delta: 56.1 MB). Peak memory consumption was 119.0 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...