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/Problem17_label13_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:44:59,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:44:59,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:44:59,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:44:59,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:44:59,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:44:59,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:44:59,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:44:59,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:44:59,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:44:59,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:44:59,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:44:59,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:45:00,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:45:00,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:45:00,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:45:00,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:45:00,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:45:00,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:45:00,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:45:00,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:45:00,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:45:00,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:45:00,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:45:00,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:45:00,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:45:00,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:45:00,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:45:00,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:45:00,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:45:00,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:45:00,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:45:00,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:45:00,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:45:00,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:45:00,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:45:00,037 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:45:00,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:45:00,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:45:00,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:45:00,053 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:45:00,053 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:45:00,053 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:45:00,056 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:45:00,056 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:45:00,056 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:45:00,056 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:45:00,057 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:45:00,057 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:45:00,057 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:45:00,057 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:45:00,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:45:00,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:45:00,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:45:00,061 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:45:00,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:45:00,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:45:00,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:45:00,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:45:00,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:45:00,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:45:00,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:45:00,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:45:00,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:45:00,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:45:00,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:45:00,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:45:00,064 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:45:00,064 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:45:00,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:45:00,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:45:00,067 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:45:00,067 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:45:00,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:45:00,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:45:00,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:45:00,142 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:45:00,143 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:45:00,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label13_false-unreach-call.c [2018-10-24 23:45:00,215 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0b186c450/a1273196663149c380efbcb09d23073d/FLAG679b35789 [2018-10-24 23:45:00,979 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:45:00,980 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label13_false-unreach-call.c [2018-10-24 23:45:01,007 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0b186c450/a1273196663149c380efbcb09d23073d/FLAG679b35789 [2018-10-24 23:45:01,024 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0b186c450/a1273196663149c380efbcb09d23073d [2018-10-24 23:45:01,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:45:01,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:45:01,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:45:01,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:45:01,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:45:01,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:01" (1/1) ... [2018-10-24 23:45:01,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:01, skipping insertion in model container [2018-10-24 23:45:01,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:01" (1/1) ... [2018-10-24 23:45:01,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:45:01,200 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:45:02,155 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:45:02,161 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:45:02,552 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:45:02,578 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:45:02,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02 WrapperNode [2018-10-24 23:45:02,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:45:02,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:45:02,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:45:02,580 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:45:02,591 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:45:02" (1/1) ... [2018-10-24 23:45:02,652 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:45:02" (1/1) ... [2018-10-24 23:45:03,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:45:03,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:45:03,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:45:03,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:45:03,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (1/1) ... [2018-10-24 23:45:03,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:45:03,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:45:03,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:45:03,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:45:03,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (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:45:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:45:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:45:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:45:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:45:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:45:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:45:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:45:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:45:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:45:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:45:13,988 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:45:13,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:13 BoogieIcfgContainer [2018-10-24 23:45:13,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:45:13,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:45:13,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:45:13,994 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:45:13,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:01" (1/3) ... [2018-10-24 23:45:13,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d91924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:13, skipping insertion in model container [2018-10-24 23:45:13,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:02" (2/3) ... [2018-10-24 23:45:13,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d91924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:13, skipping insertion in model container [2018-10-24 23:45:13,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:13" (3/3) ... [2018-10-24 23:45:13,998 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label13_false-unreach-call.c [2018-10-24 23:45:14,009 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:45:14,018 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:45:14,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:45:14,080 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:45:14,080 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:45:14,080 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:45:14,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:45:14,081 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:45:14,081 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:45:14,081 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:45:14,081 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:45:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-24 23:45:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 23:45:14,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:14,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:45:14,140 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:14,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1178650194, now seen corresponding path program 1 times [2018-10-24 23:45:14,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:14,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:14,675 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 23:45:14,688 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:45:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:14,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:45:14,695 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:14,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:45:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:45:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:45:14,722 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-24 23:45:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:25,057 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-10-24 23:45:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:45:25,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-24 23:45:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:25,099 INFO L225 Difference]: With dead ends: 2166 [2018-10-24 23:45:25,099 INFO L226 Difference]: Without dead ends: 1556 [2018-10-24 23:45:25,115 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:45:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-10-24 23:45:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-10-24 23:45:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-10-24 23:45:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-10-24 23:45:25,302 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 37 [2018-10-24 23:45:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:25,303 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-10-24 23:45:25,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:45:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-10-24 23:45:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 23:45:25,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:25,315 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:45:25,315 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:25,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1514580025, now seen corresponding path program 1 times [2018-10-24 23:45:25,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:25,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:45:25,915 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:25,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:45:25,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:45:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:45:25,918 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-10-24 23:45:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:35,791 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-10-24 23:45:35,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:45:35,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-10-24 23:45:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:35,810 INFO L225 Difference]: With dead ends: 3059 [2018-10-24 23:45:35,811 INFO L226 Difference]: Without dead ends: 1997 [2018-10-24 23:45:35,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:45:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-10-24 23:45:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-10-24 23:45:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-10-24 23:45:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-10-24 23:45:35,895 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 113 [2018-10-24 23:45:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:35,897 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-10-24 23:45:35,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:45:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-10-24 23:45:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-24 23:45:35,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:35,906 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:45:35,910 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:35,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1724480335, now seen corresponding path program 1 times [2018-10-24 23:45:35,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:35,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:35,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:35,913 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:36,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:36,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:45:36,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:36,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:45:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:45:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:45:36,188 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-10-24 23:45:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:42,199 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-10-24 23:45:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:45:42,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-10-24 23:45:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:42,218 INFO L225 Difference]: With dead ends: 4880 [2018-10-24 23:45:42,218 INFO L226 Difference]: Without dead ends: 2911 [2018-10-24 23:45:42,227 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:45:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-10-24 23:45:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-10-24 23:45:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-10-24 23:45:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-10-24 23:45:42,320 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 117 [2018-10-24 23:45:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:42,320 INFO L481 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-10-24 23:45:42,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:45:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-10-24 23:45:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-24 23:45:42,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:42,329 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:45:42,329 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:42,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1253038034, now seen corresponding path program 1 times [2018-10-24 23:45:42,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:42,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:42,334 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:42,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:42,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:45:42,578 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:42,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:45:42,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:45:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:45:42,579 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-10-24 23:45:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:51,185 INFO L93 Difference]: Finished difference Result 6193 states and 8530 transitions. [2018-10-24 23:45:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:45:51,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-10-24 23:45:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:51,201 INFO L225 Difference]: With dead ends: 6193 [2018-10-24 23:45:51,202 INFO L226 Difference]: Without dead ends: 3319 [2018-10-24 23:45:51,213 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:45:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2018-10-24 23:45:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3319. [2018-10-24 23:45:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2018-10-24 23:45:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4368 transitions. [2018-10-24 23:45:51,310 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4368 transitions. Word has length 147 [2018-10-24 23:45:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:51,310 INFO L481 AbstractCegarLoop]: Abstraction has 3319 states and 4368 transitions. [2018-10-24 23:45:51,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:45:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4368 transitions. [2018-10-24 23:45:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 23:45:51,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:51,313 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:45:51,313 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:51,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash 535521912, now seen corresponding path program 1 times [2018-10-24 23:45:51,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:51,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:51,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 23:45:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:45:51,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:51,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:45:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:45:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:45:51,568 INFO L87 Difference]: Start difference. First operand 3319 states and 4368 transitions. Second operand 4 states. [2018-10-24 23:46:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:46:02,332 INFO L93 Difference]: Finished difference Result 11940 states and 16070 transitions. [2018-10-24 23:46:02,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:46:02,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-24 23:46:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:46:02,372 INFO L225 Difference]: With dead ends: 11940 [2018-10-24 23:46:02,372 INFO L226 Difference]: Without dead ends: 8627 [2018-10-24 23:46:02,385 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:46:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2018-10-24 23:46:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2018-10-24 23:46:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2018-10-24 23:46:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 10737 transitions. [2018-10-24 23:46:02,598 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 10737 transitions. Word has length 201 [2018-10-24 23:46:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:46:02,599 INFO L481 AbstractCegarLoop]: Abstraction has 8627 states and 10737 transitions. [2018-10-24 23:46:02,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:46:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 10737 transitions. [2018-10-24 23:46:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-24 23:46:02,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:46:02,606 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,606 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:46:02,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:46:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1601051847, now seen corresponding path program 1 times [2018-10-24 23:46:02,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:46:02,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:46:02,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:46:02,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:46:02,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:46:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:46:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:46:03,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:46:03,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:46:03,148 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-10-24 23:46:03,150 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [906], [908], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-24 23:46:03,205 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:46:03,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:46:04,027 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:46:04,030 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:46:04,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:46:04,074 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:46:04,710 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 75.33% of their original sizes. [2018-10-24 23:46:04,710 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:46:04,957 INFO L413 sIntCurrentIteration]: We have 223 unified AI predicates [2018-10-24 23:46:04,957 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:46:04,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:46:04,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:46:04,962 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:46:04,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:46:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:46:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:46:04,963 INFO L87 Difference]: Start difference. First operand 8627 states and 10737 transitions. Second operand 6 states. [2018-10-24 23:47:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:47:58,652 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.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:47:58,657 INFO L168 Benchmark]: Toolchain (without parser) took 177620.11 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-24 23:47:58,658 INFO L168 Benchmark]: CDTParser took 0.21 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:47:58,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1540.07 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:47:58,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 505.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -930.4 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:47:58,661 INFO L168 Benchmark]: Boogie Preprocessor took 260.10 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:47:58,662 INFO L168 Benchmark]: RCFGBuilder took 10644.20 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: 469.8 MB). Peak memory consumption was 469.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:47:58,663 INFO L168 Benchmark]: TraceAbstraction took 164665.29 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 3.1 GB in the end (delta: -1.4 GB). Peak memory consumption was 527.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:47:58,673 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.21 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 1540.07 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 505.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -930.4 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 260.10 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10644.20 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: 469.8 MB). Peak memory consumption was 469.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164665.29 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 3.1 GB in the end (delta: -1.4 GB). Peak memory consumption was 527.9 MB. 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...