java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label09_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:22:14,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:22:14,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:22:14,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:22:14,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:22:14,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:22:14,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:22:14,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:22:14,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:22:14,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:22:14,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:22:14,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:22:14,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:22:14,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:22:14,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:22:14,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:22:14,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:22:14,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:22:14,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:22:14,320 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:22:14,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:22:14,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:22:14,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:22:14,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:22:14,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:22:14,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:22:14,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:22:14,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:22:14,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:22:14,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:22:14,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:22:14,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:22:14,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:22:14,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:22:14,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:22:14,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:22:14,333 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 12:22:14,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:22:14,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:22:14,350 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:22:14,350 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:22:14,350 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:22:14,351 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:22:14,351 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:22:14,351 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:22:14,351 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:22:14,351 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:22:14,351 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:22:14,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:22:14,352 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:22:14,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:22:14,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:22:14,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:22:14,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:22:14,353 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:22:14,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:22:14,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:22:14,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:22:14,354 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:22:14,354 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:22:14,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:22:14,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:22:14,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:22:14,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:22:14,355 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:22:14,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:22:14,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:22:14,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:22:14,356 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:22:14,356 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:22:14,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:22:14,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:22:14,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:22:14,437 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:22:14,437 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:22:14,438 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label09_false-unreach-call.c [2018-07-24 12:22:14,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e038947/3a483f2d618d46b8ac2ada9341d81e46/FLAG9ad6e55b1 [2018-07-24 12:22:15,227 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:22:15,229 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label09_false-unreach-call.c [2018-07-24 12:22:15,259 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e038947/3a483f2d618d46b8ac2ada9341d81e46/FLAG9ad6e55b1 [2018-07-24 12:22:15,281 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e038947/3a483f2d618d46b8ac2ada9341d81e46 [2018-07-24 12:22:15,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:22:15,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:22:15,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:22:15,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:22:15,311 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:22:15,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:22:15" (1/1) ... [2018-07-24 12:22:15,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d9fee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:15, skipping insertion in model container [2018-07-24 12:22:15,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:22:15" (1/1) ... [2018-07-24 12:22:15,604 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:22:16,404 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:22:16,422 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:22:16,879 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:22:17,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17 WrapperNode [2018-07-24 12:22:17,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:22:17,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:22:17,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:22:17,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:22:17,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:17,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:17,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:22:17,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:22:17,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:22:17,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:22:17,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:17,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:18,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:18,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:18,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:18,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:18,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (1/1) ... [2018-07-24 12:22:18,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:22:18,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:22:18,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:22:18,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:22:18,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (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 [2018-07-24 12:22:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:22:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:22:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:22:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:22:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:22:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:22:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output2 [2018-07-24 12:22:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output2 [2018-07-24 12:22:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 12:22:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 12:22:29,470 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:22:29,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:22:29 BoogieIcfgContainer [2018-07-24 12:22:29,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:22:29,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:22:29,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:22:29,488 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:22:29,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:22:15" (1/3) ... [2018-07-24 12:22:29,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f12a698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:22:29, skipping insertion in model container [2018-07-24 12:22:29,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:22:17" (2/3) ... [2018-07-24 12:22:29,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f12a698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:22:29, skipping insertion in model container [2018-07-24 12:22:29,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:22:29" (3/3) ... [2018-07-24 12:22:29,494 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label09_false-unreach-call.c [2018-07-24 12:22:29,507 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:22:29,520 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:22:29,596 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:22:29,597 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:22:29,597 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:22:29,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:22:29,598 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:22:29,598 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:22:29,598 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:22:29,598 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:22:29,598 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:22:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-07-24 12:22:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-24 12:22:29,647 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:22:29,648 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:22:29,648 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:22:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1337135422, now seen corresponding path program 1 times [2018-07-24 12:22:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:22:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:22:29,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:22:29,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:22:29,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:22:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:22:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:22:29,969 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:22:29,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:22:29,970 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:22:29,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:22:29,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:22:29,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:22:29,992 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 3 states. [2018-07-24 12:22:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:22:35,977 INFO L93 Difference]: Finished difference Result 1676 states and 3065 transitions. [2018-07-24 12:22:35,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:22:35,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-07-24 12:22:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:22:36,010 INFO L225 Difference]: With dead ends: 1676 [2018-07-24 12:22:36,010 INFO L226 Difference]: Without dead ends: 1070 [2018-07-24 12:22:36,020 INFO L573 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 [2018-07-24 12:22:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-07-24 12:22:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1067. [2018-07-24 12:22:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-07-24 12:22:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1636 transitions. [2018-07-24 12:22:36,157 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1636 transitions. Word has length 19 [2018-07-24 12:22:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:22:36,158 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1636 transitions. [2018-07-24 12:22:36,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:22:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1636 transitions. [2018-07-24 12:22:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-24 12:22:36,163 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:22:36,163 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:22:36,163 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:22:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1912810225, now seen corresponding path program 1 times [2018-07-24 12:22:36,165 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:22:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:22:36,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:22:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:22:36,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:22:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:22:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:22:36,699 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:22:36,700 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:22:36,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:22:36,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:22:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:22:36,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:23:05,690 WARN L169 SmtUtils]: Spent 24.31 s on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2018-07-24 12:23:26,069 WARN L169 SmtUtils]: Spent 16.13 s on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2018-07-24 12:23:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:23:26,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:23:30,976 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 16 [2018-07-24 12:23:31,223 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 52 [2018-07-24 12:23:33,964 WARN L169 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 26 [2018-07-24 12:23:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:23:34,299 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 12:23:34,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2018-07-24 12:23:34,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:23:34,303 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:23:34,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:23:34,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=159, Unknown=5, NotChecked=0, Total=210 [2018-07-24 12:23:34,304 INFO L87 Difference]: Start difference. First operand 1067 states and 1636 transitions. Second operand 6 states. [2018-07-24 12:24:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:24:30,929 INFO L93 Difference]: Finished difference Result 3986 states and 6259 transitions. [2018-07-24 12:24:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:24:30,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-07-24 12:24:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:24:30,947 INFO L225 Difference]: With dead ends: 3986 [2018-07-24 12:24:30,948 INFO L226 Difference]: Without dead ends: 2925 [2018-07-24 12:24:30,955 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=54, Invalid=181, Unknown=5, NotChecked=0, Total=240 [2018-07-24 12:24:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2018-07-24 12:24:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2891. [2018-07-24 12:24:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2891 states. [2018-07-24 12:24:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 4413 transitions. [2018-07-24 12:24:31,049 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 4413 transitions. Word has length 94 [2018-07-24 12:24:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:24:31,050 INFO L471 AbstractCegarLoop]: Abstraction has 2891 states and 4413 transitions. [2018-07-24 12:24:31,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:24:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4413 transitions. [2018-07-24 12:24:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-24 12:24:31,055 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:24:31,056 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:24:31,056 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:24:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1295221438, now seen corresponding path program 1 times [2018-07-24 12:24:31,056 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:24:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:24:31,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:24:31,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:24:31,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:24:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:24:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:24:31,343 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:24:31,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 12:24:31,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:24:31,344 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 12:24:31,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 12:24:31,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:24:31,345 INFO L87 Difference]: Start difference. First operand 2891 states and 4413 transitions. Second operand 4 states. [2018-07-24 12:24:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:24:42,235 INFO L93 Difference]: Finished difference Result 10568 states and 16800 transitions. [2018-07-24 12:24:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:24:42,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-07-24 12:24:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:24:42,283 INFO L225 Difference]: With dead ends: 10568 [2018-07-24 12:24:42,284 INFO L226 Difference]: Without dead ends: 7683 [2018-07-24 12:24:42,303 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:24:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7683 states. [2018-07-24 12:24:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7683 to 7681. [2018-07-24 12:24:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7681 states. [2018-07-24 12:24:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7681 states to 7681 states and 11325 transitions. [2018-07-24 12:24:42,538 INFO L78 Accepts]: Start accepts. Automaton has 7681 states and 11325 transitions. Word has length 129 [2018-07-24 12:24:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:24:42,539 INFO L471 AbstractCegarLoop]: Abstraction has 7681 states and 11325 transitions. [2018-07-24 12:24:42,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 12:24:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7681 states and 11325 transitions. [2018-07-24 12:24:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-24 12:24:42,544 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:24:42,545 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:24:42,545 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:24:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash -835131344, now seen corresponding path program 1 times [2018-07-24 12:24:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:24:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:24:42,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:24:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:24:42,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:24:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:24:42,851 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:24:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:24:42,908 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:24:42,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:24:42,909 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:24:42,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:24:42,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:24:42,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:24:42,910 INFO L87 Difference]: Start difference. First operand 7681 states and 11325 transitions. Second operand 6 states. [2018-07-24 12:24:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:24:53,124 INFO L93 Difference]: Finished difference Result 15515 states and 23188 transitions. [2018-07-24 12:24:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:24:53,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-07-24 12:24:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:24:53,159 INFO L225 Difference]: With dead ends: 15515 [2018-07-24 12:24:53,160 INFO L226 Difference]: Without dead ends: 7840 [2018-07-24 12:24:53,181 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:24:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2018-07-24 12:24:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 7798. [2018-07-24 12:24:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2018-07-24 12:24:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 10184 transitions. [2018-07-24 12:24:53,374 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 10184 transitions. Word has length 161 [2018-07-24 12:24:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:24:53,374 INFO L471 AbstractCegarLoop]: Abstraction has 7798 states and 10184 transitions. [2018-07-24 12:24:53,375 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:24:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 10184 transitions. [2018-07-24 12:24:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-24 12:24:53,378 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:24:53,378 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-07-24 12:24:53,378 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:24:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 657535801, now seen corresponding path program 1 times [2018-07-24 12:24:53,379 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:24:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:24:53,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:24:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:24:53,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:24:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:24:53,709 WARN L169 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:24:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-07-24 12:24:53,858 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:24:53,858 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:24:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:24:53,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:24:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:24:53,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:24:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:24:54,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:24:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:24:54,317 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:24:54,317 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:24:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:24:54,335 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:24:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:24:54,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:24:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-07-24 12:24:54,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:24:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (4)] Exception during sending of exit command (exit): Broken pipe [2018-07-24 12:24:54,837 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-07-24 12:24:54,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 12 [2018-07-24 12:24:54,839 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:24:54,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:24:54,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:24:54,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-07-24 12:24:54,841 INFO L87 Difference]: Start difference. First operand 7798 states and 10184 transitions. Second operand 5 states. [2018-07-24 12:25:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:25:00,368 INFO L93 Difference]: Finished difference Result 16504 states and 21692 transitions. [2018-07-24 12:25:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 12:25:00,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-07-24 12:25:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:25:00,418 INFO L225 Difference]: With dead ends: 16504 [2018-07-24 12:25:00,418 INFO L226 Difference]: Without dead ends: 8712 [2018-07-24 12:25:00,441 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 706 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-07-24 12:25:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2018-07-24 12:25:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 8273. [2018-07-24 12:25:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8273 states. [2018-07-24 12:25:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8273 states to 8273 states and 10073 transitions. [2018-07-24 12:25:00,646 INFO L78 Accepts]: Start accepts. Automaton has 8273 states and 10073 transitions. Word has length 179 [2018-07-24 12:25:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:25:00,647 INFO L471 AbstractCegarLoop]: Abstraction has 8273 states and 10073 transitions. [2018-07-24 12:25:00,647 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:25:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8273 states and 10073 transitions. [2018-07-24 12:25:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-24 12:25:00,650 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:25:00,651 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-07-24 12:25:00,651 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:25:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -923795896, now seen corresponding path program 1 times [2018-07-24 12:25:00,651 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:25:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:00,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:25:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:00,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:25:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:25:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-07-24 12:25:00,852 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:25:00,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:25:00,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:25:00,853 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:25:00,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:25:00,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:25:00,854 INFO L87 Difference]: Start difference. First operand 8273 states and 10073 transitions. Second operand 3 states. [2018-07-24 12:25:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:25:06,024 INFO L93 Difference]: Finished difference Result 19606 states and 24347 transitions. [2018-07-24 12:25:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:25:06,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-07-24 12:25:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:25:06,083 INFO L225 Difference]: With dead ends: 19606 [2018-07-24 12:25:06,084 INFO L226 Difference]: Without dead ends: 11339 [2018-07-24 12:25:06,109 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:25:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11339 states. [2018-07-24 12:25:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11339 to 11333. [2018-07-24 12:25:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11333 states. [2018-07-24 12:25:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11333 states to 11333 states and 13496 transitions. [2018-07-24 12:25:06,338 INFO L78 Accepts]: Start accepts. Automaton has 11333 states and 13496 transitions. Word has length 183 [2018-07-24 12:25:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:25:06,339 INFO L471 AbstractCegarLoop]: Abstraction has 11333 states and 13496 transitions. [2018-07-24 12:25:06,339 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:25:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11333 states and 13496 transitions. [2018-07-24 12:25:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-24 12:25:06,344 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:25:06,345 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-07-24 12:25:06,345 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:25:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -524054517, now seen corresponding path program 1 times [2018-07-24 12:25:06,345 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:25:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:25:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:06,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:25:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:25:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-07-24 12:25:06,677 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:25:06,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 12:25:06,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:25:06,678 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 12:25:06,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 12:25:06,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:25:06,679 INFO L87 Difference]: Start difference. First operand 11333 states and 13496 transitions. Second operand 4 states. [2018-07-24 12:25:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:25:14,982 INFO L93 Difference]: Finished difference Result 38480 states and 47399 transitions. [2018-07-24 12:25:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:25:14,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-07-24 12:25:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:25:15,086 INFO L225 Difference]: With dead ends: 38480 [2018-07-24 12:25:15,087 INFO L226 Difference]: Without dead ends: 27153 [2018-07-24 12:25:15,132 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:25:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27153 states. [2018-07-24 12:25:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27153 to 27146. [2018-07-24 12:25:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27146 states. [2018-07-24 12:25:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27146 states to 27146 states and 31821 transitions. [2018-07-24 12:25:15,709 INFO L78 Accepts]: Start accepts. Automaton has 27146 states and 31821 transitions. Word has length 228 [2018-07-24 12:25:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:25:15,710 INFO L471 AbstractCegarLoop]: Abstraction has 27146 states and 31821 transitions. [2018-07-24 12:25:15,710 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 12:25:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27146 states and 31821 transitions. [2018-07-24 12:25:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-07-24 12:25:15,719 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:25:15,720 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-07-24 12:25:15,720 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:25:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1705718465, now seen corresponding path program 1 times [2018-07-24 12:25:15,720 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:25:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:15,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:25:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:15,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:25:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:25:16,080 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-07-24 12:25:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-07-24 12:25:16,114 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:25:16,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 12:25:16,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:25:16,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 12:25:16,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 12:25:16,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:25:16,116 INFO L87 Difference]: Start difference. First operand 27146 states and 31821 transitions. Second operand 4 states. [2018-07-24 12:25:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:25:27,580 INFO L93 Difference]: Finished difference Result 71804 states and 85436 transitions. [2018-07-24 12:25:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:25:27,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2018-07-24 12:25:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:25:27,732 INFO L225 Difference]: With dead ends: 71804 [2018-07-24 12:25:27,733 INFO L226 Difference]: Without dead ends: 44664 [2018-07-24 12:25:27,822 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:25:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44664 states. [2018-07-24 12:25:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44664 to 44644. [2018-07-24 12:25:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44644 states. [2018-07-24 12:25:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44644 states to 44644 states and 51570 transitions. [2018-07-24 12:25:28,689 INFO L78 Accepts]: Start accepts. Automaton has 44644 states and 51570 transitions. Word has length 249 [2018-07-24 12:25:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:25:28,690 INFO L471 AbstractCegarLoop]: Abstraction has 44644 states and 51570 transitions. [2018-07-24 12:25:28,690 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 12:25:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44644 states and 51570 transitions. [2018-07-24 12:25:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-24 12:25:28,719 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:25:28,720 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:25:28,720 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:25:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1557556753, now seen corresponding path program 1 times [2018-07-24 12:25:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:25:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:25:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:25:28,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:25:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:25:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 81 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 12:25:29,225 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:25:29,225 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:25:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:25:29,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:25:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:25:29,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:25:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-07-24 12:25:29,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:25:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:25:30,858 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:25:30,858 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:25:30,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:25:30,881 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:25:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:25:31,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:25:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-07-24 12:25:31,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:25:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:25:32,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:25:32,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8] total 15 [2018-07-24 12:25:32,092 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:25:32,093 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 12:25:32,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 12:25:32,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-24 12:25:32,094 INFO L87 Difference]: Start difference. First operand 44644 states and 51570 transitions. Second operand 10 states. [2018-07-24 12:26:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:26:00,685 INFO L93 Difference]: Finished difference Result 145812 states and 180493 transitions. [2018-07-24 12:26:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-24 12:26:00,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 318 [2018-07-24 12:26:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:26:01,174 INFO L225 Difference]: With dead ends: 145812 [2018-07-24 12:26:01,174 INFO L226 Difference]: Without dead ends: 101174 [2018-07-24 12:26:01,364 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1292 GetRequests, 1260 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2018-07-24 12:26:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101174 states. [2018-07-24 12:26:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101174 to 99857. [2018-07-24 12:26:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99857 states. [2018-07-24 12:26:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99857 states to 99857 states and 116123 transitions. [2018-07-24 12:26:03,940 INFO L78 Accepts]: Start accepts. Automaton has 99857 states and 116123 transitions. Word has length 318 [2018-07-24 12:26:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:26:03,941 INFO L471 AbstractCegarLoop]: Abstraction has 99857 states and 116123 transitions. [2018-07-24 12:26:03,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 12:26:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 99857 states and 116123 transitions. [2018-07-24 12:26:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-24 12:26:03,965 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:26:03,966 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2018-07-24 12:26:03,966 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:26:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash -70239036, now seen corresponding path program 1 times [2018-07-24 12:26:03,966 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:26:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:26:03,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:26:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:26:03,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:26:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:26:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-07-24 12:26:04,255 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:26:04,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:26:04,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:26:04,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:26:04,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:26:04,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:26:04,257 INFO L87 Difference]: Start difference. First operand 99857 states and 116123 transitions. Second operand 3 states. [2018-07-24 12:26:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:26:12,249 INFO L93 Difference]: Finished difference Result 216977 states and 258216 transitions. [2018-07-24 12:26:12,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:26:12,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-07-24 12:26:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:26:12,776 INFO L225 Difference]: With dead ends: 216977 [2018-07-24 12:26:12,776 INFO L226 Difference]: Without dead ends: 118869 [2018-07-24 12:26:13,069 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:26:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118869 states. [2018-07-24 12:26:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118869 to 118862. [2018-07-24 12:26:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118862 states. [2018-07-24 12:26:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118862 states to 118862 states and 141174 transitions. [2018-07-24 12:26:16,290 INFO L78 Accepts]: Start accepts. Automaton has 118862 states and 141174 transitions. Word has length 328 [2018-07-24 12:26:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:26:16,291 INFO L471 AbstractCegarLoop]: Abstraction has 118862 states and 141174 transitions. [2018-07-24 12:26:16,291 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:26:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 118862 states and 141174 transitions. [2018-07-24 12:26:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-24 12:26:16,320 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:26:16,321 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2018-07-24 12:26:16,321 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:26:16,321 INFO L82 PathProgramCache]: Analyzing trace with hash -39228792, now seen corresponding path program 1 times [2018-07-24 12:26:16,321 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:26:16,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:26:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:26:16,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:26:16,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:26:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:26:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-07-24 12:26:16,676 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:26:16,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:26:16,676 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:26:16,677 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:26:16,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:26:16,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:26:16,677 INFO L87 Difference]: Start difference. First operand 118862 states and 141174 transitions. Second operand 3 states. Received shutdown request... [2018-07-24 12:26:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:26:19,607 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 12:26:19,613 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 12:26:19,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:26:19 BoogieIcfgContainer [2018-07-24 12:26:19,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:26:19,614 INFO L168 Benchmark]: Toolchain (without parser) took 244319.66 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -530.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-24 12:26:19,615 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:26:19,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1790.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-07-24 12:26:19,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 307.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 12:26:19,617 INFO L168 Benchmark]: Boogie Preprocessor took 840.23 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 922.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.7 MB. Max. memory is 7.1 GB. [2018-07-24 12:26:19,618 INFO L168 Benchmark]: RCFGBuilder took 11234.38 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 507.6 MB). Peak memory consumption was 507.6 MB. Max. memory is 7.1 GB. [2018-07-24 12:26:19,619 INFO L168 Benchmark]: TraceAbstraction took 230137.71 ms. Allocated memory was 2.5 GB in the beginning and 3.6 GB in the end (delta: 1.2 GB). Free memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: -124.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-07-24 12:26:19,624 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1790.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 307.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 840.23 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 922.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11234.38 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 507.6 MB). Peak memory consumption was 507.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 230137.71 ms. Allocated memory was 2.5 GB in the beginning and 3.6 GB in the end (delta: 1.2 GB). Free memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: -124.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 44). Cancelled while BasicCegarLoop was constructing difference of abstraction (118862states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (23161 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 230.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 155.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5641 SDtfs, 15533 SDslu, 2632 SDs, 0 SdLazy, 30732 SolverSat, 7551 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 139.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2256 GetRequests, 2172 SyntacticMatches, 17 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 59.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118862occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1877 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 63.5s InterpolantComputationTime, 3306 NumberOfCodeBlocks, 3306 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4373 ConstructedInterpolants, 279 QuantifiedInterpolants, 5663523 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2022 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 1434/1718 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label09_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-26-19-638.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label09_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-26-19-638.csv Completed graceful shutdown