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_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:15:34,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:15:34,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:15:34,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:15:34,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:15:34,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:15:34,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:15:34,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:15:34,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:15:34,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:15:34,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:15:34,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:15:34,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:15:34,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:15:34,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:15:34,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:15:34,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:15:34,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:15:34,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:15:34,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:15:34,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:15:34,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:15:34,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:15:34,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:15:34,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:15:34,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:15:34,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:15:34,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:15:34,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:15:34,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:15:34,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:15:34,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:15:34,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:15:34,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:15:34,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:15:34,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:15:34,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:15:34,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:15:34,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:15:34,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:15:34,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:15:34,327 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:15:34,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:15:34,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:15:34,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:15:34,345 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:15:34,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:15:34,346 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:15:34,346 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:15:34,346 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:15:34,347 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:15:34,348 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:15:34,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:15:34,348 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:15:34,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:15:34,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:15:34,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:15:34,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:15:34,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:15:34,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:15:34,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:15:34,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:15:34,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:15:34,351 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:15:34,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:15:34,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:15:34,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:15:34,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:15:34,353 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:15:34,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:15:34,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:15:34,353 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:15:34,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:15:34,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:15:34,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:15:34,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:15:34,430 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:15:34,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09.c [2019-10-02 17:15:34,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ec713b1/3c8aa17ff5904983a3ea88b3da177545/FLAG5482168a8 [2019-10-02 17:15:35,045 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:15:35,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label09.c [2019-10-02 17:15:35,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ec713b1/3c8aa17ff5904983a3ea88b3da177545/FLAG5482168a8 [2019-10-02 17:15:35,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ec713b1/3c8aa17ff5904983a3ea88b3da177545 [2019-10-02 17:15:35,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:15:35,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:15:35,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:15:35,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:15:35,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:15:35,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:15:35" (1/1) ... [2019-10-02 17:15:35,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6581bd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:35, skipping insertion in model container [2019-10-02 17:15:35,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:15:35" (1/1) ... [2019-10-02 17:15:35,356 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:15:35,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:15:35,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:15:35,978 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:15:36,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:15:36,112 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:15:36,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36 WrapperNode [2019-10-02 17:15:36,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:15:36,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:15:36,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:15:36,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:15:36,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (1/1) ... [2019-10-02 17:15:36,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:15:36,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:15:36,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:15:36,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:15:36,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (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:15:36,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:15:36,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:15:36,330 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:15:36,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:15:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:15:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:15:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:15:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:15:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:15:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:15:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:15:38,105 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:15:38,106 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:15:38,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:15:38 BoogieIcfgContainer [2019-10-02 17:15:38,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:15:38,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:15:38,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:15:38,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:15:38,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:15:35" (1/3) ... [2019-10-02 17:15:38,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e41dcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:15:38, skipping insertion in model container [2019-10-02 17:15:38,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:36" (2/3) ... [2019-10-02 17:15:38,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e41dcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:15:38, skipping insertion in model container [2019-10-02 17:15:38,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:15:38" (3/3) ... [2019-10-02 17:15:38,116 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label09.c [2019-10-02 17:15:38,126 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:15:38,134 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:15:38,151 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:15:38,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:15:38,179 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:15:38,179 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:15:38,180 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:15:38,180 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:15:38,180 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:15:38,180 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:15:38,180 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:15:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:15:38,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 17:15:38,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:38,221 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, 1, 1, 1, 1] [2019-10-02 17:15:38,224 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash -976875031, now seen corresponding path program 1 times [2019-10-02 17:15:38,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:38,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:38,705 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:15:38,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:15:38,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:38,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:15:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:15:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:15:38,735 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:15:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:39,750 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2019-10-02 17:15:39,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:15:39,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-02 17:15:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:39,788 INFO L225 Difference]: With dead ends: 394 [2019-10-02 17:15:39,788 INFO L226 Difference]: Without dead ends: 326 [2019-10-02 17:15:39,792 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:15:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-02 17:15:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2019-10-02 17:15:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-02 17:15:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 467 transitions. [2019-10-02 17:15:39,905 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 467 transitions. Word has length 127 [2019-10-02 17:15:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:39,906 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 467 transitions. [2019-10-02 17:15:39,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:15:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 467 transitions. [2019-10-02 17:15:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 17:15:39,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:39,912 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, 1, 1, 1, 1] [2019-10-02 17:15:39,913 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1101712018, now seen corresponding path program 1 times [2019-10-02 17:15:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:39,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:39,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:39,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:40,203 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:15:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:40,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:40,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:40,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:40,207 INFO L87 Difference]: Start difference. First operand 321 states and 467 transitions. Second operand 5 states. [2019-10-02 17:15:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:41,008 INFO L93 Difference]: Finished difference Result 408 states and 554 transitions. [2019-10-02 17:15:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:41,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-02 17:15:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:41,011 INFO L225 Difference]: With dead ends: 408 [2019-10-02 17:15:41,012 INFO L226 Difference]: Without dead ends: 321 [2019-10-02 17:15:41,013 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:15:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-02 17:15:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-10-02 17:15:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-02 17:15:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2019-10-02 17:15:41,028 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 463 transitions. Word has length 135 [2019-10-02 17:15:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:41,028 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 463 transitions. [2019-10-02 17:15:41,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 463 transitions. [2019-10-02 17:15:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 17:15:41,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:41,032 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:15:41,033 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:41,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:41,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1390328654, now seen corresponding path program 1 times [2019-10-02 17:15:41,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:41,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:41,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:41,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:41,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:15:41,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:41,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:15:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:15:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:15:41,181 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 6 states. [2019-10-02 17:15:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:42,115 INFO L93 Difference]: Finished difference Result 664 states and 986 transitions. [2019-10-02 17:15:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 17:15:42,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-02 17:15:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:42,124 INFO L225 Difference]: With dead ends: 664 [2019-10-02 17:15:42,124 INFO L226 Difference]: Without dead ends: 664 [2019-10-02 17:15:42,125 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:15:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-02 17:15:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 632. [2019-10-02 17:15:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 17:15:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 895 transitions. [2019-10-02 17:15:42,163 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 895 transitions. Word has length 137 [2019-10-02 17:15:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:42,163 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 895 transitions. [2019-10-02 17:15:42,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:15:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 895 transitions. [2019-10-02 17:15:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 17:15:42,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:42,167 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,168 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash 13692256, now seen corresponding path program 1 times [2019-10-02 17:15:42,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:42,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:42,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 17:15:42,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:42,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 17:15:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 17:15:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 17:15:42,485 INFO L87 Difference]: Start difference. First operand 632 states and 895 transitions. Second operand 7 states. [2019-10-02 17:15:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:44,083 INFO L93 Difference]: Finished difference Result 1453 states and 2056 transitions. [2019-10-02 17:15:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 17:15:44,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-02 17:15:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:44,094 INFO L225 Difference]: With dead ends: 1453 [2019-10-02 17:15:44,094 INFO L226 Difference]: Without dead ends: 1453 [2019-10-02 17:15:44,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:15:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-10-02 17:15:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1365. [2019-10-02 17:15:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-10-02 17:15:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1940 transitions. [2019-10-02 17:15:44,166 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1940 transitions. Word has length 140 [2019-10-02 17:15:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:44,166 INFO L475 AbstractCegarLoop]: Abstraction has 1365 states and 1940 transitions. [2019-10-02 17:15:44,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 17:15:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1940 transitions. [2019-10-02 17:15:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 17:15:44,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:44,172 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:15:44,173 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1527973936, now seen corresponding path program 1 times [2019-10-02 17:15:44,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:44,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:44,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:44,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:44,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:44,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:44,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:15:44,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:44,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:15:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:15:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:15:44,288 INFO L87 Difference]: Start difference. First operand 1365 states and 1940 transitions. Second operand 6 states. [2019-10-02 17:15:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:45,115 INFO L93 Difference]: Finished difference Result 1996 states and 2850 transitions. [2019-10-02 17:15:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:15:45,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-02 17:15:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:45,128 INFO L225 Difference]: With dead ends: 1996 [2019-10-02 17:15:45,128 INFO L226 Difference]: Without dead ends: 1996 [2019-10-02 17:15:45,129 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:15:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-10-02 17:15:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1968. [2019-10-02 17:15:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-10-02 17:15:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2752 transitions. [2019-10-02 17:15:45,203 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2752 transitions. Word has length 148 [2019-10-02 17:15:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:45,204 INFO L475 AbstractCegarLoop]: Abstraction has 1968 states and 2752 transitions. [2019-10-02 17:15:45,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:15:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2752 transitions. [2019-10-02 17:15:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 17:15:45,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:45,212 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, 1, 1, 1, 1] [2019-10-02 17:15:45,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash -234431911, now seen corresponding path program 1 times [2019-10-02 17:15:45,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:45,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:45,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:45,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:45,646 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:15:45,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:45,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:45,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:45,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:45,649 INFO L87 Difference]: Start difference. First operand 1968 states and 2752 transitions. Second operand 5 states. [2019-10-02 17:15:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:46,328 INFO L93 Difference]: Finished difference Result 2054 states and 2841 transitions. [2019-10-02 17:15:46,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:46,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-02 17:15:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:46,340 INFO L225 Difference]: With dead ends: 2054 [2019-10-02 17:15:46,341 INFO L226 Difference]: Without dead ends: 1968 [2019-10-02 17:15:46,341 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:15:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-10-02 17:15:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1968. [2019-10-02 17:15:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-10-02 17:15:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2702 transitions. [2019-10-02 17:15:46,397 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2702 transitions. Word has length 153 [2019-10-02 17:15:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:46,398 INFO L475 AbstractCegarLoop]: Abstraction has 1968 states and 2702 transitions. [2019-10-02 17:15:46,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2702 transitions. [2019-10-02 17:15:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 17:15:46,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:46,404 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:15:46,405 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1639097634, now seen corresponding path program 1 times [2019-10-02 17:15:46,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:46,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:46,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 17:15:46,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:15:46,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:15:46,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-10-02 17:15:46,478 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [83], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [695], [697], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:15:46,536 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:15:46,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:17:35,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:17:35,760 INFO L272 AbstractInterpreter]: Visited 128 different actions 128 times. Never merged. Never widened. Performed 193 root evaluator evaluations with a maximum evaluation depth of 18. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Never found a fixpoint. Largest state had 38 variables. [2019-10-02 17:17:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:17:35,765 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:19:19,904 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 81.06% of their original sizes. [2019-10-02 17:19:19,904 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:19:20,015 INFO L420 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2019-10-02 17:19:20,015 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:19:20,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:19:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2019-10-02 17:19:20,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:19:20,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 17:19:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 17:19:20,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-10-02 17:19:20,018 INFO L87 Difference]: Start difference. First operand 1968 states and 2702 transitions. Second operand 11 states. [2019-10-02 17:19:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:19:33,152 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:19:33,159 INFO L168 Benchmark]: Toolchain (without parser) took 237823.15 ms. Allocated memory was 138.4 MB in the beginning and 439.9 MB in the end (delta: 301.5 MB). Free memory was 82.7 MB in the beginning and 280.0 MB in the end (delta: -197.3 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. [2019-10-02 17:19:33,160 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 102.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:19:33,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.65 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 82.4 MB in the beginning and 158.1 MB in the end (delta: -75.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-10-02 17:19:33,162 INFO L168 Benchmark]: Boogie Preprocessor took 119.00 ms. Allocated memory is still 199.2 MB. Free memory was 158.1 MB in the beginning and 153.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-02 17:19:33,163 INFO L168 Benchmark]: RCFGBuilder took 1875.18 ms. Allocated memory was 199.2 MB in the beginning and 221.2 MB in the end (delta: 22.0 MB). Free memory was 153.1 MB in the beginning and 167.4 MB in the end (delta: -14.3 MB). Peak memory consumption was 86.9 MB. Max. memory is 7.1 GB. [2019-10-02 17:19:33,164 INFO L168 Benchmark]: TraceAbstraction took 235047.49 ms. Allocated memory was 221.2 MB in the beginning and 439.9 MB in the end (delta: 218.6 MB). Free memory was 167.4 MB in the beginning and 280.0 MB in the end (delta: -112.6 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2019-10-02 17:19:33,169 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.65 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 82.4 MB in the beginning and 158.1 MB in the end (delta: -75.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.00 ms. Allocated memory is still 199.2 MB. Free memory was 158.1 MB in the beginning and 153.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1875.18 ms. Allocated memory was 199.2 MB in the beginning and 221.2 MB in the end (delta: 22.0 MB). Free memory was 153.1 MB in the beginning and 167.4 MB in the end (delta: -14.3 MB). Peak memory consumption was 86.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235047.49 ms. Allocated memory was 221.2 MB in the beginning and 439.9 MB in the end (delta: 218.6 MB). Free memory was 167.4 MB in the beginning and 280.0 MB in the end (delta: -112.6 MB). Peak memory consumption was 106.1 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...