java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label01_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:49:48,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:49:48,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:49:48,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:49:48,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:49:48,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:49:48,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:49:48,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:49:48,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:49:48,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:49:48,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:49:48,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:49:48,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:49:48,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:49:48,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:49:48,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:49:48,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:49:48,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:49:48,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:49:48,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:49:48,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:49:48,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:49:48,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:49:48,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:49:48,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:49:48,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:49:48,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:49:48,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:49:48,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:49:48,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:49:48,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:49:48,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:49:48,254 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:49:48,254 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:49:48,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:49:48,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:49:48,257 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:49:48,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:49:48,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:49:48,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:49:48,289 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:49:48,289 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:49:48,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:49:48,289 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:49:48,289 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:49:48,289 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:49:48,290 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:49:48,290 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:49:48,291 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:49:48,291 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:49:48,291 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:49:48,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:49:48,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:49:48,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:49:48,293 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:49:48,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:49:48,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:49:48,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:49:48,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:49:48,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:49:48,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:49:48,296 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:49:48,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:49:48,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:49:48,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:49:48,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:49:48,297 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:49:48,297 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:49:48,297 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:49:48,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:49:48,298 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:49:48,298 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:49:48,298 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:49:48,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:49:48,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:49:48,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:49:48,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:49:48,368 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:49:48,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label01_false-unreach-call.c [2018-10-24 23:49:48,429 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0fd14f264/1b39c156803142689fc9b9b62afce508/FLAG6aec4e1a5 [2018-10-24 23:49:49,148 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:49:49,149 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label01_false-unreach-call.c [2018-10-24 23:49:49,176 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0fd14f264/1b39c156803142689fc9b9b62afce508/FLAG6aec4e1a5 [2018-10-24 23:49:49,194 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0fd14f264/1b39c156803142689fc9b9b62afce508 [2018-10-24 23:49:49,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:49:49,210 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:49:49,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:49:49,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:49:49,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:49:49,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:49:49" (1/1) ... [2018-10-24 23:49:49,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:49, skipping insertion in model container [2018-10-24 23:49:49,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:49:49" (1/1) ... [2018-10-24 23:49:49,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:49:49,354 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:49:50,354 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:49:50,359 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:49:50,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:49:50,817 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:49:50,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50 WrapperNode [2018-10-24 23:49:50,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:49:50,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:49:50,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:49:50,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:49:50,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:50,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:49:51,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:49:51,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:49:51,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:49:51,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... [2018-10-24 23:49:51,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:49:51,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:49:51,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:49:51,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:49:51,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 23:49:51,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:49:51,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:49:51,541 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:49:51,541 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:49:51,541 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:49:51,541 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:49:51,542 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:49:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:49:51,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:49:51,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:49:51,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:49:51,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:49:59,456 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:49:59,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:49:59 BoogieIcfgContainer [2018-10-24 23:49:59,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:49:59,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:49:59,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:49:59,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:49:59,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:49:49" (1/3) ... [2018-10-24 23:49:59,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97028d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:49:59, skipping insertion in model container [2018-10-24 23:49:59,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:50" (2/3) ... [2018-10-24 23:49:59,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97028d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:49:59, skipping insertion in model container [2018-10-24 23:49:59,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:49:59" (3/3) ... [2018-10-24 23:49:59,466 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label01_false-unreach-call.c [2018-10-24 23:49:59,477 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:49:59,487 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:49:59,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:49:59,562 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:49:59,563 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:49:59,563 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:49:59,563 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:49:59,563 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:49:59,563 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:49:59,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:49:59,564 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:49:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-24 23:49:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 23:49:59,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:49:59,619 INFO L375 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] [2018-10-24 23:49:59,622 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:49:59,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:49:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash -585368433, now seen corresponding path program 1 times [2018-10-24 23:49:59,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:49:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:49:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:49:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:49:59,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:49:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:00,141 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:50:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:00,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:00,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:50:00,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:00,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:50:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:50:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:50:00,278 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-24 23:50:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:07,811 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-24 23:50:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:50:07,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-24 23:50:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:07,846 INFO L225 Difference]: With dead ends: 2251 [2018-10-24 23:50:07,846 INFO L226 Difference]: Without dead ends: 1474 [2018-10-24 23:50:07,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:50:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-24 23:50:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-24 23:50:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-24 23:50:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2801 transitions. [2018-10-24 23:50:08,016 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2801 transitions. Word has length 33 [2018-10-24 23:50:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:08,016 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2801 transitions. [2018-10-24 23:50:08,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:50:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2801 transitions. [2018-10-24 23:50:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-24 23:50:08,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:08,026 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:50:08,026 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:08,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1568281720, now seen corresponding path program 1 times [2018-10-24 23:50:08,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:08,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:08,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:08,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:08,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:50:08,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:08,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:50:08,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:50:08,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:50:08,303 INFO L87 Difference]: Start difference. First operand 1474 states and 2801 transitions. Second operand 6 states. [2018-10-24 23:50:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:19,810 INFO L93 Difference]: Finished difference Result 5789 states and 11192 transitions. [2018-10-24 23:50:19,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:50:19,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-10-24 23:50:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:19,846 INFO L225 Difference]: With dead ends: 5789 [2018-10-24 23:50:19,846 INFO L226 Difference]: Without dead ends: 4321 [2018-10-24 23:50:19,856 INFO L605 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-10-24 23:50:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2018-10-24 23:50:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4295. [2018-10-24 23:50:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4295 states. [2018-10-24 23:50:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 7032 transitions. [2018-10-24 23:50:20,000 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 7032 transitions. Word has length 107 [2018-10-24 23:50:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:20,001 INFO L481 AbstractCegarLoop]: Abstraction has 4295 states and 7032 transitions. [2018-10-24 23:50:20,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:50:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 7032 transitions. [2018-10-24 23:50:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-24 23:50:20,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:20,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:50:20,009 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:20,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash -599106287, now seen corresponding path program 1 times [2018-10-24 23:50:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:20,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:20,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:20,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:50:20,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:20,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:50:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:50:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:50:20,188 INFO L87 Difference]: Start difference. First operand 4295 states and 7032 transitions. Second operand 5 states. [2018-10-24 23:50:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:31,683 INFO L93 Difference]: Finished difference Result 14335 states and 23470 transitions. [2018-10-24 23:50:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:50:31,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-10-24 23:50:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:31,732 INFO L225 Difference]: With dead ends: 14335 [2018-10-24 23:50:31,732 INFO L226 Difference]: Without dead ends: 10046 [2018-10-24 23:50:31,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:50:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10046 states. [2018-10-24 23:50:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10046 to 9940. [2018-10-24 23:50:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9940 states. [2018-10-24 23:50:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9940 states to 9940 states and 14580 transitions. [2018-10-24 23:50:31,990 INFO L78 Accepts]: Start accepts. Automaton has 9940 states and 14580 transitions. Word has length 110 [2018-10-24 23:50:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:31,991 INFO L481 AbstractCegarLoop]: Abstraction has 9940 states and 14580 transitions. [2018-10-24 23:50:31,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:50:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9940 states and 14580 transitions. [2018-10-24 23:50:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-24 23:50:31,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:32,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:50:32,004 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:32,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:32,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2057431661, now seen corresponding path program 1 times [2018-10-24 23:50:32,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:32,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:32,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:32,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:32,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:50:32,276 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:32,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:50:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:50:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:50:32,278 INFO L87 Difference]: Start difference. First operand 9940 states and 14580 transitions. Second operand 4 states. [2018-10-24 23:50:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:41,007 INFO L93 Difference]: Finished difference Result 29925 states and 46845 transitions. [2018-10-24 23:50:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:50:41,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-10-24 23:50:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:41,079 INFO L225 Difference]: With dead ends: 29925 [2018-10-24 23:50:41,080 INFO L226 Difference]: Without dead ends: 19991 [2018-10-24 23:50:41,119 INFO L605 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-10-24 23:50:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19991 states. [2018-10-24 23:50:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19991 to 19988. [2018-10-24 23:50:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19988 states. [2018-10-24 23:50:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19988 states to 19988 states and 29114 transitions. [2018-10-24 23:50:41,502 INFO L78 Accepts]: Start accepts. Automaton has 19988 states and 29114 transitions. Word has length 140 [2018-10-24 23:50:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:41,502 INFO L481 AbstractCegarLoop]: Abstraction has 19988 states and 29114 transitions. [2018-10-24 23:50:41,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:50:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 19988 states and 29114 transitions. [2018-10-24 23:50:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 23:50:41,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:41,509 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:50:41,509 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:41,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1604325120, now seen corresponding path program 1 times [2018-10-24 23:50:41,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:41,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:41,804 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:50:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 52 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:50:41,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:50:41,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:50:41,958 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-10-24 23:50:41,960 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1787], [1789], [1792], [1800], [1808], [1816], [1824], [1832], [1840], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2116], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2144], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-24 23:50:42,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:50:42,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:50:42,373 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:50:42,374 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:50:42,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:42,401 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:50:42,859 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 77.72% of their original sizes. [2018-10-24 23:50:42,859 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:50:43,117 INFO L413 sIntCurrentIteration]: We have 179 unified AI predicates [2018-10-24 23:50:43,117 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:50:43,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:50:43,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-24 23:50:43,118 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:43,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:50:43,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:50:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:50:43,120 INFO L87 Difference]: Start difference. First operand 19988 states and 29114 transitions. Second operand 6 states. [2018-10-24 23:51:21,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:51:21,117 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) 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.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2018-10-24 23:51:21,122 INFO L168 Benchmark]: Toolchain (without parser) took 91913.77 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -553.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-24 23:51:21,124 INFO L168 Benchmark]: CDTParser took 0.22 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-10-24 23:51:21,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1607.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:21,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 417.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -971.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:21,126 INFO L168 Benchmark]: Boogie Preprocessor took 223.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:21,127 INFO L168 Benchmark]: RCFGBuilder took 7996.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 505.3 MB). Peak memory consumption was 505.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:21,128 INFO L168 Benchmark]: TraceAbstraction took 81662.46 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -249.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 23:51:21,134 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.22 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 1607.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 417.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -971.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 223.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7996.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 505.3 MB). Peak memory consumption was 505.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81662.46 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -249.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...