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/Problem13_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:35:41,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:35:41,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:35:41,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:35:41,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:35:41,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:35:41,995 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:35:41,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:35:41,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:35:42,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:35:42,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:35:42,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:35:42,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:35:42,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:35:42,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:35:42,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:35:42,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:35:42,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:35:42,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:35:42,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:35:42,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:35:42,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:35:42,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:35:42,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:35:42,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:35:42,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:35:42,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:35:42,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:35:42,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:35:42,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:35:42,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:35:42,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:35:42,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:35:42,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:35:42,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:35:42,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:35:42,052 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:35:42,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:35:42,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:35:42,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:35:42,078 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:35:42,078 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:35:42,078 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:35:42,078 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:35:42,079 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:35:42,079 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:35:42,079 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:35:42,079 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:35:42,079 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:35:42,080 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:35:42,080 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:35:42,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:35:42,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:35:42,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:35:42,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:35:42,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:35:42,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:35:42,082 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:35:42,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:35:42,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:35:42,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:35:42,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:35:42,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:35:42,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:35:42,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:35:42,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:35:42,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:35:42,084 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:35:42,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:35:42,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:35:42,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:35:42,085 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:35:42,085 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:35:42,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:35:42,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:35:42,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:35:42,170 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:35:42,171 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:35:42,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c [2018-10-24 23:35:42,234 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f61ef7e8/b9ca83ba40c24538ad1bf8ed15a7995d/FLAGd16ec2931 [2018-10-24 23:35:43,004 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:35:43,005 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c [2018-10-24 23:35:43,035 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f61ef7e8/b9ca83ba40c24538ad1bf8ed15a7995d/FLAGd16ec2931 [2018-10-24 23:35:43,055 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f61ef7e8/b9ca83ba40c24538ad1bf8ed15a7995d [2018-10-24 23:35:43,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:35:43,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:35:43,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:35:43,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:35:43,073 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:35:43,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:35:43" (1/1) ... [2018-10-24 23:35:43,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b33a858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:43, skipping insertion in model container [2018-10-24 23:35:43,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:35:43" (1/1) ... [2018-10-24 23:35:43,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:35:43,266 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:35:44,851 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:35:44,857 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:35:45,600 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:35:45,639 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:35:45,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45 WrapperNode [2018-10-24 23:35:45,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:35:45,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:35:45,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:35:45,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:35:45,652 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:35:45" (1/1) ... [2018-10-24 23:35:45,730 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:35:45" (1/1) ... [2018-10-24 23:35:46,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:35:46,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:35:46,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:35:46,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:35:46,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (1/1) ... [2018-10-24 23:35:46,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:35:46,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:35:46,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:35:46,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:35:46,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (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:35:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:35:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:35:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:35:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:35:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:35:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:35:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:35:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:35:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:35:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:35:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:35:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:35:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:35:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:35:59,496 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:35:59,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:35:59 BoogieIcfgContainer [2018-10-24 23:35:59,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:35:59,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:35:59,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:35:59,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:35:59,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:35:43" (1/3) ... [2018-10-24 23:35:59,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0ddaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:35:59, skipping insertion in model container [2018-10-24 23:35:59,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:45" (2/3) ... [2018-10-24 23:35:59,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0ddaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:35:59, skipping insertion in model container [2018-10-24 23:35:59,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:35:59" (3/3) ... [2018-10-24 23:35:59,505 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label29_false-unreach-call.c [2018-10-24 23:35:59,515 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:35:59,524 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:35:59,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:35:59,588 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:35:59,588 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:35:59,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:35:59,589 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:35:59,589 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:35:59,589 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:35:59,589 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:35:59,589 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:35:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:35:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 23:35:59,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:59,653 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] [2018-10-24 23:35:59,655 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:59,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1714801547, now seen corresponding path program 1 times [2018-10-24 23:35:59,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:59,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:59,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:59,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:59,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:00,146 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:36:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:00,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:36:00,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:00,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:36:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:36:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:36:00,207 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-24 23:36:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:16,727 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-10-24 23:36:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:36:16,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-24 23:36:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:16,774 INFO L225 Difference]: With dead ends: 3968 [2018-10-24 23:36:16,774 INFO L226 Difference]: Without dead ends: 2842 [2018-10-24 23:36:16,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:36:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-24 23:36:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-10-24 23:36:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-10-24 23:36:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-10-24 23:36:16,970 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 21 [2018-10-24 23:36:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:16,971 INFO L481 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-10-24 23:36:16,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:36:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-10-24 23:36:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 23:36:16,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:16,977 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:36:16,977 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:16,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1914103630, now seen corresponding path program 1 times [2018-10-24 23:36:16,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:16,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:16,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:17,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:17,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:36:17,342 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:17,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:36:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:36:17,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:36:17,344 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-10-24 23:36:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:30,872 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-10-24 23:36:30,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:36:30,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-10-24 23:36:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:30,898 INFO L225 Difference]: With dead ends: 5673 [2018-10-24 23:36:30,898 INFO L226 Difference]: Without dead ends: 3698 [2018-10-24 23:36:30,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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:36:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-10-24 23:36:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-10-24 23:36:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-10-24 23:36:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-10-24 23:36:31,011 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 91 [2018-10-24 23:36:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:31,011 INFO L481 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-10-24 23:36:31,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:36:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-10-24 23:36:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-24 23:36:31,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:31,015 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:36:31,016 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:31,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash 688522610, now seen corresponding path program 1 times [2018-10-24 23:36:31,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:31,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:31,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:31,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:31,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:31,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:36:31,200 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:31,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:36:31,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:36:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:36:31,201 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-10-24 23:36:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:44,295 INFO L93 Difference]: Finished difference Result 10963 states and 17865 transitions. [2018-10-24 23:36:44,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:36:44,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-10-24 23:36:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:44,336 INFO L225 Difference]: With dead ends: 10963 [2018-10-24 23:36:44,337 INFO L226 Difference]: Without dead ends: 7282 [2018-10-24 23:36:44,350 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:36:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2018-10-24 23:36:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7175. [2018-10-24 23:36:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-10-24 23:36:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 10520 transitions. [2018-10-24 23:36:44,598 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 10520 transitions. Word has length 93 [2018-10-24 23:36:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:44,598 INFO L481 AbstractCegarLoop]: Abstraction has 7175 states and 10520 transitions. [2018-10-24 23:36:44,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:36:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10520 transitions. [2018-10-24 23:36:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 23:36:44,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:44,603 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:36:44,603 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:44,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1754078826, now seen corresponding path program 1 times [2018-10-24 23:36:44,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:44,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:44,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:44,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:44,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:36:44,811 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:44,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:36:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:36:44,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:36:44,814 INFO L87 Difference]: Start difference. First operand 7175 states and 10520 transitions. Second operand 3 states. [2018-10-24 23:36:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:51,724 INFO L93 Difference]: Finished difference Result 21003 states and 32063 transitions. [2018-10-24 23:36:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:36:51,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-10-24 23:36:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:51,792 INFO L225 Difference]: With dead ends: 21003 [2018-10-24 23:36:51,792 INFO L226 Difference]: Without dead ends: 13834 [2018-10-24 23:36:51,830 INFO L605 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-10-24 23:36:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13834 states. [2018-10-24 23:36:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13834 to 13825. [2018-10-24 23:36:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2018-10-24 23:36:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19394 transitions. [2018-10-24 23:36:52,186 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19394 transitions. Word has length 137 [2018-10-24 23:36:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:52,187 INFO L481 AbstractCegarLoop]: Abstraction has 13825 states and 19394 transitions. [2018-10-24 23:36:52,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:36:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19394 transitions. [2018-10-24 23:36:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 23:36:52,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:52,194 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:36:52,194 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:52,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1376680716, now seen corresponding path program 1 times [2018-10-24 23:36:52,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:52,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:52,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:52,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:52,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:52,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:52,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:36:52,437 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:52,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:36:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:36:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:36:52,439 INFO L87 Difference]: Start difference. First operand 13825 states and 19394 transitions. Second operand 4 states. [2018-10-24 23:37:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:03,612 INFO L93 Difference]: Finished difference Result 53953 states and 81179 transitions. [2018-10-24 23:37:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:37:03,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-10-24 23:37:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:03,790 INFO L225 Difference]: With dead ends: 53953 [2018-10-24 23:37:03,791 INFO L226 Difference]: Without dead ends: 39321 [2018-10-24 23:37:03,873 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:37:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39321 states. [2018-10-24 23:37:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39321 to 39285. [2018-10-24 23:37:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39285 states. [2018-10-24 23:37:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39285 states to 39285 states and 54287 transitions. [2018-10-24 23:37:04,789 INFO L78 Accepts]: Start accepts. Automaton has 39285 states and 54287 transitions. Word has length 142 [2018-10-24 23:37:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:04,790 INFO L481 AbstractCegarLoop]: Abstraction has 39285 states and 54287 transitions. [2018-10-24 23:37:04,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:37:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 39285 states and 54287 transitions. [2018-10-24 23:37:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 23:37:04,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:04,796 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 23:37:04,796 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:04,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1914147908, now seen corresponding path program 1 times [2018-10-24 23:37:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:04,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:04,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:05,086 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:37:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:37:05,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:37:05,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:37:05,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-10-24 23:37:05,525 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2695], [2697], [2700], [2708], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3128], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3202], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:37:05,600 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:37:05,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:37:06,103 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:37:06,106 INFO L272 AbstractInterpreter]: Visited 92 different actions 92 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:37:06,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:06,150 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:37:06,657 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 70.76% of their original sizes. [2018-10-24 23:37:06,657 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:37:06,778 INFO L413 sIntCurrentIteration]: We have 179 unified AI predicates [2018-10-24 23:37:06,779 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:37:06,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:37:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:37:06,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:06,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:37:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:37:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:37:06,789 INFO L87 Difference]: Start difference. First operand 39285 states and 54287 transitions. Second operand 6 states. [2018-10-24 23:37:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:37:11,463 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:93) 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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java: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:37:11,478 INFO L168 Benchmark]: Toolchain (without parser) took 88410.37 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -211.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 23:37:11,479 INFO L168 Benchmark]: CDTParser took 0.20 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:37:11,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2571.59 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: 245.7 MB). Peak memory consumption was 245.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:11,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 608.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 818.9 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:11,487 INFO L168 Benchmark]: Boogie Preprocessor took 425.05 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:11,488 INFO L168 Benchmark]: RCFGBuilder took 12821.67 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 180.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 651.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:11,492 INFO L168 Benchmark]: TraceAbstraction took 71979.24 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 532.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 571.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 23:37:11,501 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.20 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 2571.59 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: 245.7 MB). Peak memory consumption was 245.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 608.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 818.9 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 425.05 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12821.67 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 180.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 651.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71979.24 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 532.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 571.6 MB). Peak memory consumption was 1.1 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...