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_label52_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:53:10,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:53:10,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:53:10,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:53:10,267 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:53:10,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:53:10,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:53:10,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:53:10,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:53:10,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:53:10,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:53:10,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:53:10,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:53:10,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:53:10,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:53:10,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:53:10,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:53:10,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:53:10,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:53:10,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:53:10,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:53:10,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:53:10,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:53:10,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:53:10,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:53:10,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:53:10,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:53:10,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:53:10,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:53:10,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:53:10,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:53:10,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:53:10,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:53:10,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:53:10,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:53:10,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:53:10,304 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:53:10,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:53:10,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:53:10,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:53:10,322 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:53:10,322 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:53:10,322 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:53:10,322 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:53:10,322 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:53:10,323 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:53:10,323 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:53:10,323 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:53:10,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:53:10,323 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:53:10,324 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:53:10,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:53:10,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:53:10,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:53:10,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:53:10,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:53:10,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:53:10,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:53:10,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:53:10,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:53:10,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:53:10,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:53:10,326 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:53:10,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:53:10,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:53:10,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:53:10,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:53:10,328 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:53:10,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:53:10,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:53:10,328 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:53:10,328 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:53:10,328 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:53:10,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:53:10,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:53:10,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:53:10,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:53:10,406 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:53:10,406 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label52_false-unreach-call.c [2018-10-24 23:53:10,471 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c0442be90/f554a66b14b843a5be118272cc8abd25/FLAGadfff3e60 [2018-10-24 23:53:11,262 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:53:11,264 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label52_false-unreach-call.c [2018-10-24 23:53:11,294 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c0442be90/f554a66b14b843a5be118272cc8abd25/FLAGadfff3e60 [2018-10-24 23:53:11,316 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c0442be90/f554a66b14b843a5be118272cc8abd25 [2018-10-24 23:53:11,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:53:11,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:53:11,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:53:11,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:53:11,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:53:11,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:11" (1/1) ... [2018-10-24 23:53:11,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:11, skipping insertion in model container [2018-10-24 23:53:11,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:11" (1/1) ... [2018-10-24 23:53:11,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:53:11,512 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:53:12,598 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:53:12,603 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:53:13,064 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:53:13,096 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:53:13,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13 WrapperNode [2018-10-24 23:53:13,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:53:13,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:53:13,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:53:13,099 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:53:13,109 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:53:13" (1/1) ... [2018-10-24 23:53:13,180 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:53:13" (1/1) ... [2018-10-24 23:53:13,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:53:13,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:53:13,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:53:13,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:53:13,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (1/1) ... [2018-10-24 23:53:13,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:53:13,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:53:13,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:53:13,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:53:13,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (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:53:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:53:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:53:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:53:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:53:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:53:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:53:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:53:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:53:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:53:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:53:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:53:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:53:23,228 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:53:23,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:23 BoogieIcfgContainer [2018-10-24 23:53:23,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:53:23,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:53:23,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:53:23,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:53:23,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:53:11" (1/3) ... [2018-10-24 23:53:23,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3388c74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:23, skipping insertion in model container [2018-10-24 23:53:23,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:13" (2/3) ... [2018-10-24 23:53:23,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3388c74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:23, skipping insertion in model container [2018-10-24 23:53:23,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:23" (3/3) ... [2018-10-24 23:53:23,240 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label52_false-unreach-call.c [2018-10-24 23:53:23,251 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:53:23,262 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:53:23,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:53:23,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:53:23,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:53:23,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:53:23,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:53:23,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:53:23,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:53:23,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:53:23,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:53:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-24 23:53:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 23:53:23,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:23,373 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] [2018-10-24 23:53:23,375 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:23,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1718178119, now seen corresponding path program 1 times [2018-10-24 23:53:23,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:23,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:23,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:23,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:23,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:23,765 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:53:23,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:23,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:53:23,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:23,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:53:23,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:53:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:53:23,806 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 4 states. [2018-10-24 23:53:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:34,764 INFO L93 Difference]: Finished difference Result 2974 states and 5747 transitions. [2018-10-24 23:53:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:53:34,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-24 23:53:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:34,813 INFO L225 Difference]: With dead ends: 2974 [2018-10-24 23:53:34,813 INFO L226 Difference]: Without dead ends: 2193 [2018-10-24 23:53:34,824 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:53:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-10-24 23:53:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2193. [2018-10-24 23:53:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2018-10-24 23:53:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3506 transitions. [2018-10-24 23:53:35,022 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3506 transitions. Word has length 23 [2018-10-24 23:53:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:35,022 INFO L481 AbstractCegarLoop]: Abstraction has 2193 states and 3506 transitions. [2018-10-24 23:53:35,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:53:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3506 transitions. [2018-10-24 23:53:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-24 23:53:35,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:35,029 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:53:35,029 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:35,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1227431640, now seen corresponding path program 1 times [2018-10-24 23:53:35,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:35,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:35,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:35,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:35,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:53:35,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:35,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:53:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:53:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:53:35,429 INFO L87 Difference]: Start difference. First operand 2193 states and 3506 transitions. Second operand 5 states. [2018-10-24 23:53:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:45,147 INFO L93 Difference]: Finished difference Result 6600 states and 10738 transitions. [2018-10-24 23:53:45,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:45,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-10-24 23:53:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:45,182 INFO L225 Difference]: With dead ends: 6600 [2018-10-24 23:53:45,182 INFO L226 Difference]: Without dead ends: 4413 [2018-10-24 23:53:45,191 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:53:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-10-24 23:53:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4378. [2018-10-24 23:53:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2018-10-24 23:53:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6712 transitions. [2018-10-24 23:53:45,351 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6712 transitions. Word has length 93 [2018-10-24 23:53:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:45,353 INFO L481 AbstractCegarLoop]: Abstraction has 4378 states and 6712 transitions. [2018-10-24 23:53:45,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:53:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6712 transitions. [2018-10-24 23:53:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 23:53:45,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:45,366 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:53:45,367 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:45,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1923349871, now seen corresponding path program 1 times [2018-10-24 23:53:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:45,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:45,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:45,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:45,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:53:45,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:45,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:45,679 INFO L87 Difference]: Start difference. First operand 4378 states and 6712 transitions. Second operand 6 states. [2018-10-24 23:53:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:51,739 INFO L93 Difference]: Finished difference Result 11002 states and 16943 transitions. [2018-10-24 23:53:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:51,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-10-24 23:53:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:51,781 INFO L225 Difference]: With dead ends: 11002 [2018-10-24 23:53:51,781 INFO L226 Difference]: Without dead ends: 6630 [2018-10-24 23:53:51,796 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:53:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2018-10-24 23:53:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6590. [2018-10-24 23:53:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2018-10-24 23:53:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 8773 transitions. [2018-10-24 23:53:51,970 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 8773 transitions. Word has length 120 [2018-10-24 23:53:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:51,970 INFO L481 AbstractCegarLoop]: Abstraction has 6590 states and 8773 transitions. [2018-10-24 23:53:51,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 8773 transitions. [2018-10-24 23:53:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-24 23:53:51,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:51,978 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:53:51,978 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:51,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1072228357, now seen corresponding path program 1 times [2018-10-24 23:53:51,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:51,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:51,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:52,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:53:52,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:52,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:53:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:53:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:53:52,148 INFO L87 Difference]: Start difference. First operand 6590 states and 8773 transitions. Second operand 4 states. [2018-10-24 23:53:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:57,857 INFO L93 Difference]: Finished difference Result 13174 states and 17554 transitions. [2018-10-24 23:53:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:53:57,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-10-24 23:53:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:57,884 INFO L225 Difference]: With dead ends: 13174 [2018-10-24 23:53:57,884 INFO L226 Difference]: Without dead ends: 6590 [2018-10-24 23:53:57,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:53:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2018-10-24 23:53:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6590. [2018-10-24 23:53:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2018-10-24 23:53:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 8069 transitions. [2018-10-24 23:53:58,047 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 8069 transitions. Word has length 130 [2018-10-24 23:53:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:58,048 INFO L481 AbstractCegarLoop]: Abstraction has 6590 states and 8069 transitions. [2018-10-24 23:53:58,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:53:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 8069 transitions. [2018-10-24 23:53:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-24 23:53:58,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:58,051 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 23:53:58,051 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:58,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2065744106, now seen corresponding path program 1 times [2018-10-24 23:53:58,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:58,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 23:53:58,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:58,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:53:58,299 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:58,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:53:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:53:58,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:53:58,300 INFO L87 Difference]: Start difference. First operand 6590 states and 8069 transitions. Second operand 4 states. [2018-10-24 23:54:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:54:05,966 INFO L93 Difference]: Finished difference Result 26037 states and 32773 transitions. [2018-10-24 23:54:05,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:54:05,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-10-24 23:54:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:54:06,027 INFO L225 Difference]: With dead ends: 26037 [2018-10-24 23:54:06,028 INFO L226 Difference]: Without dead ends: 19453 [2018-10-24 23:54:06,050 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:54:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19453 states. [2018-10-24 23:54:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19453 to 18750. [2018-10-24 23:54:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18750 states. [2018-10-24 23:54:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18750 states to 18750 states and 22778 transitions. [2018-10-24 23:54:06,431 INFO L78 Accepts]: Start accepts. Automaton has 18750 states and 22778 transitions. Word has length 200 [2018-10-24 23:54:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:54:06,431 INFO L481 AbstractCegarLoop]: Abstraction has 18750 states and 22778 transitions. [2018-10-24 23:54:06,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:54:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18750 states and 22778 transitions. [2018-10-24 23:54:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 23:54:06,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:54:06,437 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2018-10-24 23:54:06,437 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:54:06,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:54:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash -495991293, now seen corresponding path program 1 times [2018-10-24 23:54:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:54:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:54:06,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:54:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:54:06,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:54:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:54:06,850 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-10-24 23:54:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 32 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:54:07,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:54:07,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:54:07,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-10-24 23:54:07,028 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1707], [1709], [1712], [1720], [1728], [1736], [1744], [1752], [1760], [1768], [1776], [1784], [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], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2192], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2264], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-24 23:54:07,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:54:07,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:54:07,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:54:07,860 INFO L272 AbstractInterpreter]: Visited 112 different actions 112 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:54:07,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:54:07,906 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:54:08,680 INFO L232 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 77.42% of their original sizes. [2018-10-24 23:54:08,681 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:54:08,942 INFO L413 sIntCurrentIteration]: We have 218 unified AI predicates [2018-10-24 23:54:08,942 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:54:08,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:54:08,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-24 23:54:08,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:54:08,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:54:08,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:54:08,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:54:08,945 INFO L87 Difference]: Start difference. First operand 18750 states and 22778 transitions. Second operand 6 states. [2018-10-24 23:55:10,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:55:10,416 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:93) 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: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:55:10,424 INFO L168 Benchmark]: Toolchain (without parser) took 119093.56 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 284.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:55:10,426 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:55:10,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1759.70 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: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:55:10,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 398.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -956.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:55:10,428 INFO L168 Benchmark]: Boogie Preprocessor took 225.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:55:10,431 INFO L168 Benchmark]: RCFGBuilder took 9506.03 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: 496.0 MB). Peak memory consumption was 496.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:55:10,438 INFO L168 Benchmark]: TraceAbstraction took 107192.28 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 3.7 GB in the end (delta: -2.0 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:55:10,444 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 1759.70 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: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 398.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -956.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9506.03 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: 496.0 MB). Peak memory consumption was 496.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107192.28 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 3.7 GB in the end (delta: -2.0 GB). There was no memory consumed. 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...