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_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:27:45,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:27:45,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:27:45,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:27:45,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:27:45,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:27:45,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:27:45,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:27:45,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:27:45,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:27:45,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:27:45,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:27:45,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:27:45,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:27:45,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:27:45,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:27:45,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:27:45,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:27:45,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:27:45,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:27:45,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:27:45,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:27:45,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:27:45,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:27:45,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:27:45,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:27:45,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:27:45,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:27:45,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:27:45,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:27:45,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:27:45,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:27:45,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:27:45,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:27:45,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:27:45,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:27:45,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:27:45,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:27:45,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:27:45,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:27:45,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:27:45,105 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:27:45,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:27:45,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:27:45,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:27:45,122 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:27:45,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:27:45,123 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:27:45,123 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:27:45,123 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:27:45,123 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:27:45,123 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:27:45,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:27:45,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:27:45,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:27:45,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:27:45,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:27:45,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:27:45,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:27:45,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:27:45,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:27:45,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:27:45,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:27:45,126 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:27:45,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:27:45,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:27:45,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:27:45,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:27:45,127 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:27:45,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:27:45,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:27:45,128 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:27:45,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:27:45,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:27:45,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:27:45,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:27:45,176 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:27:45,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-10-02 17:27:45,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2f27ad/a53fbbca064441e59f244769fdc30174/FLAG8359ea29f [2019-10-02 17:27:45,834 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:27:45,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-10-02 17:27:45,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2f27ad/a53fbbca064441e59f244769fdc30174/FLAG8359ea29f [2019-10-02 17:27:46,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2f27ad/a53fbbca064441e59f244769fdc30174 [2019-10-02 17:27:46,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:27:46,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:27:46,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:27:46,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:27:46,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:27:46,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54161a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46, skipping insertion in model container [2019-10-02 17:27:46,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:27:46,152 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:27:46,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:27:46,552 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:27:46,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:27:46,768 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:27:46,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46 WrapperNode [2019-10-02 17:27:46,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:27:46,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:27:46,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:27:46,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:27:46,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,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:27:46" (1/1) ... [2019-10-02 17:27:46,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (1/1) ... [2019-10-02 17:27:46,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:27:46,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:27:46,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:27:46,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:27:46,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (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:27:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:27:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:27:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:27:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:27:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:27:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:27:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:27:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:27:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:27:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:27:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:27:48,162 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:27:48,163 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:27:48,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:27:48 BoogieIcfgContainer [2019-10-02 17:27:48,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:27:48,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:27:48,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:27:48,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:27:48,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:27:46" (1/3) ... [2019-10-02 17:27:48,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ab6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:27:48, skipping insertion in model container [2019-10-02 17:27:48,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:27:46" (2/3) ... [2019-10-02 17:27:48,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ab6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:27:48, skipping insertion in model container [2019-10-02 17:27:48,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:27:48" (3/3) ... [2019-10-02 17:27:48,176 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label24.c [2019-10-02 17:27:48,186 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:27:48,196 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:27:48,213 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:27:48,250 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:27:48,251 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:27:48,251 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:27:48,251 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:27:48,252 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:27:48,252 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:27:48,252 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:27:48,252 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:27:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:27:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 17:27:48,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:27:48,317 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] [2019-10-02 17:27:48,319 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:27:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash -382656490, now seen corresponding path program 1 times [2019-10-02 17:27:48,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:27:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:48,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:27:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:48,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:27:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:27:48,815 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:27:48,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:27:48,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:27:48,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:27:48,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:27:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:27:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:27:48,840 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:27:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:27:49,843 INFO L93 Difference]: Finished difference Result 388 states and 585 transitions. [2019-10-02 17:27:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:27:49,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-02 17:27:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:27:49,862 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:27:49,863 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:27:49,864 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:27:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:27:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-10-02 17:27:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-02 17:27:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 466 transitions. [2019-10-02 17:27:49,938 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 466 transitions. Word has length 120 [2019-10-02 17:27:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:27:49,939 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 466 transitions. [2019-10-02 17:27:49,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:27:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 466 transitions. [2019-10-02 17:27:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 17:27:49,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:27:49,944 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] [2019-10-02 17:27:49,944 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:27:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1033455567, now seen corresponding path program 1 times [2019-10-02 17:27:49,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:27:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:49,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:27:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:49,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:27:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:27:50,210 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:27:50,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:27:50,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:27:50,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:27:50,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:27:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:27:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:27:50,214 INFO L87 Difference]: Start difference. First operand 319 states and 466 transitions. Second operand 5 states. [2019-10-02 17:27:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:27:50,912 INFO L93 Difference]: Finished difference Result 406 states and 553 transitions. [2019-10-02 17:27:50,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:27:50,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-02 17:27:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:27:50,923 INFO L225 Difference]: With dead ends: 406 [2019-10-02 17:27:50,923 INFO L226 Difference]: Without dead ends: 319 [2019-10-02 17:27:50,924 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:27:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-02 17:27:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-10-02 17:27:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-02 17:27:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 463 transitions. [2019-10-02 17:27:50,968 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 463 transitions. Word has length 128 [2019-10-02 17:27:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:27:50,969 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 463 transitions. [2019-10-02 17:27:50,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:27:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 463 transitions. [2019-10-02 17:27:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 17:27:50,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:27:50,980 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, 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:27:50,981 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:27:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1674841520, now seen corresponding path program 1 times [2019-10-02 17:27:50,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:27:50,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:27:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:50,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:27:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:27:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:27:51,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:27:51,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:27:51,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:27:51,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:27:51,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:27:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:27:51,173 INFO L87 Difference]: Start difference. First operand 319 states and 463 transitions. Second operand 6 states. [2019-10-02 17:27:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:27:51,973 INFO L93 Difference]: Finished difference Result 628 states and 899 transitions. [2019-10-02 17:27:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:27:51,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-02 17:27:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:27:51,980 INFO L225 Difference]: With dead ends: 628 [2019-10-02 17:27:51,980 INFO L226 Difference]: Without dead ends: 628 [2019-10-02 17:27:51,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:27:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-02 17:27:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2019-10-02 17:27:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 17:27:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 883 transitions. [2019-10-02 17:27:52,013 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 883 transitions. Word has length 153 [2019-10-02 17:27:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:27:52,014 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 883 transitions. [2019-10-02 17:27:52,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:27:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 883 transitions. [2019-10-02 17:27:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 17:27:52,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:27:52,018 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, 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] [2019-10-02 17:27:52,018 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:27:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash 549018262, now seen corresponding path program 1 times [2019-10-02 17:27:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:27:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:52,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:27:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:52,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:27:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:27:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:27:52,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:27:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:27:52,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:27:52,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:27:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:27:52,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:27:52,158 INFO L87 Difference]: Start difference. First operand 620 states and 883 transitions. Second operand 3 states. [2019-10-02 17:27:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:27:52,721 INFO L93 Difference]: Finished difference Result 1214 states and 1704 transitions. [2019-10-02 17:27:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:27:52,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-02 17:27:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:27:52,731 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 17:27:52,731 INFO L226 Difference]: Without dead ends: 1214 [2019-10-02 17:27:52,731 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:27:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-10-02 17:27:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1065. [2019-10-02 17:27:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-10-02 17:27:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1499 transitions. [2019-10-02 17:27:52,767 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1499 transitions. Word has length 154 [2019-10-02 17:27:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:27:52,768 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1499 transitions. [2019-10-02 17:27:52,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:27:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1499 transitions. [2019-10-02 17:27:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 17:27:52,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:27:52,773 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, 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] [2019-10-02 17:27:52,774 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:27:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:52,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1668983788, now seen corresponding path program 1 times [2019-10-02 17:27:52,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:27:52,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:52,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:27:52,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:27:52,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:27:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:27:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:27:52,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:27:52,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:27:52,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2019-10-02 17:27:52,963 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], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [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], [639], [641], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:27:53,011 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:27:53,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:33:48,049 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:33:48,053 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 4 different actions 4 times. Never widened. Performed 500 root evaluator evaluations with a maximum evaluation depth of 18. Performed 500 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:33:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:33:48,057 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:37:45,975 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 80.88% of their original sizes. [2019-10-02 17:37:45,976 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:37:46,165 INFO L420 sIntCurrentIteration]: We unified 170 AI predicates to 170 [2019-10-02 17:37:46,165 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:37:46,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:37:46,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-10-02 17:37:46,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:46,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 17:37:46,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 17:37:46,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-10-02 17:37:46,168 INFO L87 Difference]: Start difference. First operand 1065 states and 1499 transitions. Second operand 16 states. [2019-10-02 17:38:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:38:08,886 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:08,893 INFO L168 Benchmark]: Toolchain (without parser) took 622816.09 ms. Allocated memory was 139.5 MB in the beginning and 314.0 MB in the end (delta: 174.6 MB). Free memory was 85.8 MB in the beginning and 104.5 MB in the end (delta: -18.7 MB). Peak memory consumption was 155.9 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:08,895 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 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:08,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.10 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 85.6 MB in the beginning and 169.3 MB in the end (delta: -83.7 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:08,899 INFO L168 Benchmark]: Boogie Preprocessor took 98.44 ms. Allocated memory is still 202.4 MB. Free memory was 169.3 MB in the beginning and 164.0 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:08,900 INFO L168 Benchmark]: RCFGBuilder took 1297.24 ms. Allocated memory was 202.4 MB in the beginning and 226.5 MB in the end (delta: 24.1 MB). Free memory was 164.0 MB in the beginning and 180.1 MB in the end (delta: -16.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:08,901 INFO L168 Benchmark]: TraceAbstraction took 620722.82 ms. Allocated memory was 226.5 MB in the beginning and 314.0 MB in the end (delta: 87.6 MB). Free memory was 180.1 MB in the beginning and 104.5 MB in the end (delta: 75.6 MB). Peak memory consumption was 163.2 MB. Max. memory is 7.1 GB. [2019-10-02 17:38:08,905 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 690.10 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 85.6 MB in the beginning and 169.3 MB in the end (delta: -83.7 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.44 ms. Allocated memory is still 202.4 MB. Free memory was 169.3 MB in the beginning and 164.0 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1297.24 ms. Allocated memory was 202.4 MB in the beginning and 226.5 MB in the end (delta: 24.1 MB). Free memory was 164.0 MB in the beginning and 180.1 MB in the end (delta: -16.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 620722.82 ms. Allocated memory was 226.5 MB in the beginning and 314.0 MB in the end (delta: 87.6 MB). Free memory was 180.1 MB in the beginning and 104.5 MB in the end (delta: 75.6 MB). Peak memory consumption was 163.2 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...