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_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:33:32,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:33:32,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:33:32,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:33:32,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:33:32,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:33:32,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:33:32,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:33:32,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:33:32,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:33:32,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:33:32,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:33:32,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:33:32,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:33:32,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:33:32,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:33:32,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:33:32,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:33:32,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:33:32,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:33:32,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:33:32,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:33:32,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:33:32,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:33:32,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:33:32,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:33:32,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:33:32,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:33:32,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:33:32,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:33:32,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:33:32,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:33:32,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:33:32,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:33:32,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:33:32,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:33:32,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:33:32,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:33:32,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:33:32,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:33:32,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:33:32,949 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:33:32,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:33:32,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:33:32,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:33:32,967 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:33:32,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:33:32,968 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:33:32,968 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:33:32,968 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:33:32,969 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:33:32,969 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:33:32,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:33:32,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:33:32,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:33:32,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:33:32,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:33:32,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:33:32,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:33:32,971 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:33:32,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:33:32,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:33:32,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:33:32,972 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:33:32,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:33:32,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:33:32,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:33:32,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:33:32,973 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:33:32,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:33:32,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:33:32,973 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:33:33,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:33:33,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:33:33,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:33:33,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:33:33,029 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:33:33,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label35.c [2019-10-02 17:33:33,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e8dd875/045b24e11c8c4154bc18917d319b3acb/FLAGf650cb240 [2019-10-02 17:33:33,630 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:33:33,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label35.c [2019-10-02 17:33:33,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e8dd875/045b24e11c8c4154bc18917d319b3acb/FLAGf650cb240 [2019-10-02 17:33:33,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e8dd875/045b24e11c8c4154bc18917d319b3acb [2019-10-02 17:33:33,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:33:33,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:33:33,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:33:33,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:33:33,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:33:33,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:33:33" (1/1) ... [2019-10-02 17:33:33,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24115530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:33, skipping insertion in model container [2019-10-02 17:33:33,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:33:33" (1/1) ... [2019-10-02 17:33:33,990 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:33:34,046 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:33:34,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:33:34,560 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:33:34,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:33:34,777 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:33:34,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34 WrapperNode [2019-10-02 17:33:34,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:33:34,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:33:34,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:33:34,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:33:34,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (1/1) ... [2019-10-02 17:33:34,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:33:34,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:33:34,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:33:34,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:33:34,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (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:33:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:33:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:33:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:33:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:33:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:33:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:33:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:33:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:33:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:33:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:33:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:33:36,096 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:33:36,096 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:33:36,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:33:36 BoogieIcfgContainer [2019-10-02 17:33:36,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:33:36,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:33:36,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:33:36,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:33:36,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:33:33" (1/3) ... [2019-10-02 17:33:36,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2a370c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:33:36, skipping insertion in model container [2019-10-02 17:33:36,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:33:34" (2/3) ... [2019-10-02 17:33:36,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2a370c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:33:36, skipping insertion in model container [2019-10-02 17:33:36,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:33:36" (3/3) ... [2019-10-02 17:33:36,106 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label35.c [2019-10-02 17:33:36,116 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:33:36,124 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:33:36,140 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:33:36,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:33:36,173 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:33:36,173 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:33:36,174 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:33:36,174 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:33:36,174 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:33:36,174 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:33:36,174 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:33:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:33:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 17:33:36,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:33:36,217 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:33:36,219 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:33:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:33:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1838417414, now seen corresponding path program 1 times [2019-10-02 17:33:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:33:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:36,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:33:36,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:36,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:33:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:33:36,617 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:33:36,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:33:36,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:33:36,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:33:36,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:33:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:33:36,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:33:36,647 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:33:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:33:37,550 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2019-10-02 17:33:37,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:33:37,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-02 17:33:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:33:37,571 INFO L225 Difference]: With dead ends: 394 [2019-10-02 17:33:37,571 INFO L226 Difference]: Without dead ends: 326 [2019-10-02 17:33:37,573 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:33:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-02 17:33:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2019-10-02 17:33:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-02 17:33:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 467 transitions. [2019-10-02 17:33:37,679 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 467 transitions. Word has length 100 [2019-10-02 17:33:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:33:37,681 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 467 transitions. [2019-10-02 17:33:37,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:33:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 467 transitions. [2019-10-02 17:33:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 17:33:37,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:33:37,695 INFO L411 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] [2019-10-02 17:33:37,696 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:33:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:33:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash 937720225, now seen corresponding path program 1 times [2019-10-02 17:33:37,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:33:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:37,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:33:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:37,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:33:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:33:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:33:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:33:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:33:37,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:33:37,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:33:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:33:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:33:37,874 INFO L87 Difference]: Start difference. First operand 321 states and 467 transitions. Second operand 3 states. [2019-10-02 17:33:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:33:38,455 INFO L93 Difference]: Finished difference Result 612 states and 797 transitions. [2019-10-02 17:33:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:33:38,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-02 17:33:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:33:38,461 INFO L225 Difference]: With dead ends: 612 [2019-10-02 17:33:38,461 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 17:33:38,462 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:33:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 17:33:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 17:33:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 17:33:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 797 transitions. [2019-10-02 17:33:38,504 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 797 transitions. Word has length 108 [2019-10-02 17:33:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:33:38,508 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 797 transitions. [2019-10-02 17:33:38,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:33:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 797 transitions. [2019-10-02 17:33:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 17:33:38,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:33:38,516 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:33:38,516 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:33:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:33:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1220059375, now seen corresponding path program 1 times [2019-10-02 17:33:38,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:33:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:38,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:33:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:38,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:33:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:33:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:33:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:33:38,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:33:38,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:33:38,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:33:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:33:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:33:38,692 INFO L87 Difference]: Start difference. First operand 612 states and 797 transitions. Second operand 3 states. [2019-10-02 17:33:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:33:39,274 INFO L93 Difference]: Finished difference Result 1188 states and 1533 transitions. [2019-10-02 17:33:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:33:39,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-02 17:33:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:33:39,289 INFO L225 Difference]: With dead ends: 1188 [2019-10-02 17:33:39,289 INFO L226 Difference]: Without dead ends: 1188 [2019-10-02 17:33:39,290 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:33:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-10-02 17:33:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1044. [2019-10-02 17:33:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-10-02 17:33:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1361 transitions. [2019-10-02 17:33:39,333 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1361 transitions. Word has length 113 [2019-10-02 17:33:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:33:39,333 INFO L475 AbstractCegarLoop]: Abstraction has 1044 states and 1361 transitions. [2019-10-02 17:33:39,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:33:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1361 transitions. [2019-10-02 17:33:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 17:33:39,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:33:39,338 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:33:39,339 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:33:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:33:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1877121071, now seen corresponding path program 1 times [2019-10-02 17:33:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:33:39,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:33:39,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:33:39,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:33:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:33:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 17:33:39,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:33:39,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:33:39,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2019-10-02 17:33:39,479 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [59], [63], [64], [68], [72], [76], [79], [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], [419], [427], [435], [443], [451], [459], [467], [475], [479], [481], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:33:39,527 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:33:39,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:35:39,583 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:35:39,586 INFO L272 AbstractInterpreter]: Visited 101 different actions 101 times. Never merged. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 18. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Never found a fixpoint. Largest state had 38 variables. [2019-10-02 17:35:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:35:39,592 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:37:56,904 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 80.54% of their original sizes. [2019-10-02 17:37:56,905 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:37:56,958 INFO L420 sIntCurrentIteration]: We unified 143 AI predicates to 143 [2019-10-02 17:37:56,958 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:37:56,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:37:56,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 17:37:56,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:56,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 17:37:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 17:37:56,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-02 17:37:56,961 INFO L87 Difference]: Start difference. First operand 1044 states and 1361 transitions. Second operand 10 states. [2019-10-02 17:38:07,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:38:07,820 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:38:07,827 INFO L168 Benchmark]: Toolchain (without parser) took 273851.70 ms. Allocated memory was 140.5 MB in the beginning and 380.6 MB in the end (delta: 240.1 MB). Free memory was 87.0 MB in the beginning and 88.1 MB in the end (delta: -1.2 MB). Peak memory consumption was 239.0 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:07,827 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 17:38:07,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.06 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 86.7 MB in the beginning and 160.8 MB in the end (delta: -74.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:07,829 INFO L168 Benchmark]: Boogie Preprocessor took 107.36 ms. Allocated memory is still 201.3 MB. Free memory was 160.8 MB in the beginning and 155.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:07,830 INFO L168 Benchmark]: RCFGBuilder took 1212.32 ms. Allocated memory was 201.3 MB in the beginning and 227.5 MB in the end (delta: 26.2 MB). Free memory was 155.7 MB in the beginning and 170.8 MB in the end (delta: -15.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:07,831 INFO L168 Benchmark]: TraceAbstraction took 271724.91 ms. Allocated memory was 227.5 MB in the beginning and 380.6 MB in the end (delta: 153.1 MB). Free memory was 170.8 MB in the beginning and 88.1 MB in the end (delta: 82.7 MB). Peak memory consumption was 235.7 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:07,840 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.06 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 86.7 MB in the beginning and 160.8 MB in the end (delta: -74.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.36 ms. Allocated memory is still 201.3 MB. Free memory was 160.8 MB in the beginning and 155.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1212.32 ms. Allocated memory was 201.3 MB in the beginning and 227.5 MB in the end (delta: 26.2 MB). Free memory was 155.7 MB in the beginning and 170.8 MB in the end (delta: -15.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 271724.91 ms. Allocated memory was 227.5 MB in the beginning and 380.6 MB in the end (delta: 153.1 MB). Free memory was 170.8 MB in the beginning and 88.1 MB in the end (delta: 82.7 MB). Peak memory consumption was 235.7 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...