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_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:19:35,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:19:35,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:19:35,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:19:35,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:19:35,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:19:35,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:19:35,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:19:35,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:19:35,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:19:35,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:19:35,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:19:35,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:19:35,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:19:35,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:19:35,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:19:35,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:19:35,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:19:35,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:19:35,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:19:35,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:19:35,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:19:35,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:19:35,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:19:35,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:19:35,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:19:35,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:19:35,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:19:35,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:19:35,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:19:35,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:19:35,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:19:35,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:19:35,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:19:35,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:19:35,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:19:35,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:19:35,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:19:35,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:19:35,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:19:35,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:19:35,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 17:19:35,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:19:35,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:19:35,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:19:35,877 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:19:35,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:19:35,878 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:19:35,878 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:19:35,879 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:19:35,879 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:19:35,879 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:19:35,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:19:35,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:19:35,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:19:35,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:19:35,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:19:35,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:19:35,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:19:35,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:19:35,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:19:35,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:19:35,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:19:35,882 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:19:35,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:19:35,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:19:35,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:19:35,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:19:35,883 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:19:35,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:19:35,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:19:35,884 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:19:35,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:19:35,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:19:35,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:19:35,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:19:35,938 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:19:35,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14.c [2019-10-02 17:19:36,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88b98334/c618d95f11004e92829a2fbbf4acd5d6/FLAG3d163fe27 [2019-10-02 17:19:36,597 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:19:36,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label14.c [2019-10-02 17:19:36,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88b98334/c618d95f11004e92829a2fbbf4acd5d6/FLAG3d163fe27 [2019-10-02 17:19:36,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88b98334/c618d95f11004e92829a2fbbf4acd5d6 [2019-10-02 17:19:36,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:19:36,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:19:36,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:19:36,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:19:36,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:19:36,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:19:36" (1/1) ... [2019-10-02 17:19:36,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d289120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:36, skipping insertion in model container [2019-10-02 17:19:36,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:19:36" (1/1) ... [2019-10-02 17:19:36,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:19:36,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:19:37,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:19:37,450 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:19:37,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:19:37,634 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:19:37,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37 WrapperNode [2019-10-02 17:19:37,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:19:37,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:19:37,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:19:37,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:19:37,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... [2019-10-02 17:19:37,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:19:37,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:19:37,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:19:37,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:19:37,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:19:37,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:19:37,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:19:37,851 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:19:37,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:19:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:19:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:19:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:19:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:19:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:19:37,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:19:37,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:19:39,162 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:19:39,163 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:19:39,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:19:39 BoogieIcfgContainer [2019-10-02 17:19:39,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:19:39,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:19:39,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:19:39,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:19:39,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:19:36" (1/3) ... [2019-10-02 17:19:39,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@958b172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:19:39, skipping insertion in model container [2019-10-02 17:19:39,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:19:37" (2/3) ... [2019-10-02 17:19:39,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@958b172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:19:39, skipping insertion in model container [2019-10-02 17:19:39,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:19:39" (3/3) ... [2019-10-02 17:19:39,174 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2019-10-02 17:19:39,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:19:39,195 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:19:39,215 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:19:39,257 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:19:39,257 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:19:39,258 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:19:39,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:19:39,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:19:39,258 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:19:39,258 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:19:39,259 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:19:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:19:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 17:19:39,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:39,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:39,302 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash -871643495, now seen corresponding path program 1 times [2019-10-02 17:19:39,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:39,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:39,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:39,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:39,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:19:39,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:39,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:19:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:19:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:19:39,890 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:19:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:40,853 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:19:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:19:40,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-02 17:19:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:40,873 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:19:40,873 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:19:40,875 INFO L640 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-10-02 17:19:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:19:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:19:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:19:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:19:40,951 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 123 [2019-10-02 17:19:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:40,952 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:19:40,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:19:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:19:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 17:19:40,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:40,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:40,958 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1344572258, now seen corresponding path program 1 times [2019-10-02 17:19:40,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:40,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:41,359 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:19:41,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:41,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:41,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:41,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:41,364 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:19:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:42,138 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:19:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:42,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-02 17:19:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:42,145 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:19:42,145 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:19:42,149 INFO L640 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-10-02 17:19:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:19:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:19:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:19:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:19:42,185 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 131 [2019-10-02 17:19:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:42,185 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:19:42,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:19:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 17:19:42,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:42,193 INFO L411 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] [2019-10-02 17:19:42,194 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1612994454, now seen corresponding path program 1 times [2019-10-02 17:19:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:42,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:42,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:42,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:42,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:42,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:42,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:42,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:42,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:42,616 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:19:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:43,330 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:19:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:43,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-02 17:19:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:43,333 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:19:43,333 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:19:43,334 INFO L640 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-10-02 17:19:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:19:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:19:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:19:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:19:43,346 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 137 [2019-10-02 17:19:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:43,347 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:19:43,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:19:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 17:19:43,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:43,349 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:43,350 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash -295293823, now seen corresponding path program 1 times [2019-10-02 17:19:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:43,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:43,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:43,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:43,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:19:43,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:43,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:19:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:19:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:19:43,436 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:19:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:44,321 INFO L93 Difference]: Finished difference Result 637 states and 894 transitions. [2019-10-02 17:19:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:19:44,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 17:19:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:44,333 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:19:44,333 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:19:44,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:19:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:19:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:19:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:19:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 17:19:44,359 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 145 [2019-10-02 17:19:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:44,360 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 17:19:44,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:19:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 17:19:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 17:19:44,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:44,363 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:44,364 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1344349755, now seen corresponding path program 1 times [2019-10-02 17:19:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:44,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:44,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:44,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:44,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:44,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:44,569 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 17:19:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:45,283 INFO L93 Difference]: Finished difference Result 710 states and 957 transitions. [2019-10-02 17:19:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:45,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-02 17:19:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:45,289 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:19:45,290 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:19:45,290 INFO L640 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-10-02 17:19:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:19:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:19:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:19:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 17:19:45,309 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 147 [2019-10-02 17:19:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:45,309 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 17:19:45,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 17:19:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 17:19:45,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:45,313 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:19:45,313 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2124265719, now seen corresponding path program 1 times [2019-10-02 17:19:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:45,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:45,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:45,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:45,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:45,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:45,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:19:45,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:45,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:19:45,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:19:45,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:19:45,514 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 17:19:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:46,174 INFO L93 Difference]: Finished difference Result 712 states and 947 transitions. [2019-10-02 17:19:46,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:19:46,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-02 17:19:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:46,178 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:19:46,178 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:19:46,179 INFO L640 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-10-02 17:19:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:19:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:19:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:19:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 17:19:46,198 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 149 [2019-10-02 17:19:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:46,199 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 17:19:46,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:19:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 17:19:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 17:19:46,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:46,202 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 17:19:46,203 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash 566845841, now seen corresponding path program 1 times [2019-10-02 17:19:46,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:46,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:46,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:46,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:46,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:19:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:19:46,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:46,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:19:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:19:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:19:46,346 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 17:19:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:19:47,063 INFO L93 Difference]: Finished difference Result 1238 states and 1702 transitions. [2019-10-02 17:19:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:19:47,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-02 17:19:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:19:47,076 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:19:47,076 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:19:47,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:19:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:19:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:19:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:19:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 17:19:47,133 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 153 [2019-10-02 17:19:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:19:47,133 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 17:19:47,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:19:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 17:19:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 17:19:47,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:19:47,140 INFO L411 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] [2019-10-02 17:19:47,141 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:19:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:19:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1114474735, now seen corresponding path program 1 times [2019-10-02 17:19:47,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:19:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:47,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:19:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:19:47,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:19:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:19:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:19:47,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:19:47,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:19:47,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-10-02 17:19:47,281 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], [663], [665], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:19:47,339 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:19:47,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:26:34,416 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:26:34,419 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 times. Merged at 4 different actions 4 times. Never widened. Performed 514 root evaluator evaluations with a maximum evaluation depth of 18. Performed 514 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-10-02 17:26:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:26:34,424 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:31:59,564 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 80.92% of their original sizes. [2019-10-02 17:31:59,565 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:31:59,771 INFO L420 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2019-10-02 17:31:59,771 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:31:59,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:31:59,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-10-02 17:31:59,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:31:59,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 17:31:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 17:31:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-10-02 17:31:59,774 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 16 states. [2019-10-02 17:32:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:32:20,448 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:32:20,456 INFO L168 Benchmark]: Toolchain (without parser) took 763578.54 ms. Allocated memory was 138.9 MB in the beginning and 347.1 MB in the end (delta: 208.1 MB). Free memory was 85.1 MB in the beginning and 175.6 MB in the end (delta: -90.5 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-10-02 17:32:20,457 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 104.9 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:32:20,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.17 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 84.9 MB in the beginning and 160.0 MB in the end (delta: -75.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-10-02 17:32:20,459 INFO L168 Benchmark]: Boogie Preprocessor took 132.30 ms. Allocated memory is still 201.3 MB. Free memory was 160.0 MB in the beginning and 155.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-10-02 17:32:20,461 INFO L168 Benchmark]: RCFGBuilder took 1396.75 ms. Allocated memory was 201.3 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Free memory was 155.4 MB in the beginning and 170.7 MB in the end (delta: -15.2 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-10-02 17:32:20,462 INFO L168 Benchmark]: TraceAbstraction took 761286.73 ms. Allocated memory was 223.3 MB in the beginning and 347.1 MB in the end (delta: 123.7 MB). Free memory was 170.7 MB in the beginning and 175.6 MB in the end (delta: -4.9 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. [2019-10-02 17:32:20,466 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.17 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 84.9 MB in the beginning and 160.0 MB in the end (delta: -75.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.30 ms. Allocated memory is still 201.3 MB. Free memory was 160.0 MB in the beginning and 155.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1396.75 ms. Allocated memory was 201.3 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Free memory was 155.4 MB in the beginning and 170.7 MB in the end (delta: -15.2 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 761286.73 ms. Allocated memory was 223.3 MB in the beginning and 347.1 MB in the end (delta: 123.7 MB). Free memory was 170.7 MB in the beginning and 175.6 MB in the end (delta: -4.9 MB). Peak memory consumption was 118.8 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...