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_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:06:51,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:06:51,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:06:51,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:06:51,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:06:51,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:06:51,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:06:51,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:06:51,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:06:51,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:06:51,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:06:51,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:06:51,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:06:51,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:06:51,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:06:51,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:06:51,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:06:51,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:06:51,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:06:51,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:06:51,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:06:51,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:06:51,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:06:51,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:06:51,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:06:51,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:06:51,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:06:51,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:06:51,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:06:51,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:06:51,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:06:51,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:06:51,075 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:06:51,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:06:51,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:06:51,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:06:51,078 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-25 02:06:51,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:06:51,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:06:51,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:06:51,093 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:06:51,094 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:06:51,094 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:06:51,094 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:06:51,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:06:51,094 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:06:51,095 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:06:51,095 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:06:51,095 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:06:51,095 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:06:51,095 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:06:51,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:06:51,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:06:51,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:06:51,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:06:51,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:06:51,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:06:51,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:06:51,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:06:51,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:06:51,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:06:51,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:06:51,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:06:51,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:06:51,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:06:51,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:06:51,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:06:51,099 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:06:51,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:06:51,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:06:51,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:06:51,100 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:06:51,100 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:06:51,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:06:51,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:06:51,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:06:51,168 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:06:51,168 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:06:51,169 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label44_true-unreach-call.c [2018-10-25 02:06:51,249 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c1f264fe7/270d11f92b814d74949b9241e36ca228/FLAG2fe0e9427 [2018-10-25 02:06:52,036 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:06:52,037 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label44_true-unreach-call.c [2018-10-25 02:06:52,068 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c1f264fe7/270d11f92b814d74949b9241e36ca228/FLAG2fe0e9427 [2018-10-25 02:06:52,090 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c1f264fe7/270d11f92b814d74949b9241e36ca228 [2018-10-25 02:06:52,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:06:52,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:06:52,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:06:52,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:06:52,113 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:06:52,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:06:52" (1/1) ... [2018-10-25 02:06:52,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a192096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:52, skipping insertion in model container [2018-10-25 02:06:52,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:06:52" (1/1) ... [2018-10-25 02:06:52,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:06:52,265 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:06:53,306 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:06:53,310 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:06:53,796 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:06:53,826 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:06:53,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53 WrapperNode [2018-10-25 02:06:53,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:06:53,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:06:53,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:06:53,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:06:53,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:53,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:06:54,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:06:54,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:06:54,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:06:54,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (1/1) ... [2018-10-25 02:06:54,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:06:54,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:06:54,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:06:54,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:06:54,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (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-25 02:06:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:06:54,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:06:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:06:54,502 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:06:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:06:54,503 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:06:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:06:54,503 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:06:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:06:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:06:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:06:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:07:02,492 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:07:02,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:07:02 BoogieIcfgContainer [2018-10-25 02:07:02,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:07:02,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:07:02,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:07:02,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:07:02,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:06:52" (1/3) ... [2018-10-25 02:07:02,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ff50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:07:02, skipping insertion in model container [2018-10-25 02:07:02,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:06:53" (2/3) ... [2018-10-25 02:07:02,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ff50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:07:02, skipping insertion in model container [2018-10-25 02:07:02,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:07:02" (3/3) ... [2018-10-25 02:07:02,504 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label44_true-unreach-call.c [2018-10-25 02:07:02,514 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:07:02,524 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:07:02,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:07:02,587 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:07:02,587 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:07:02,587 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:07:02,587 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:07:02,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:07:02,588 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:07:02,588 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:07:02,588 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:07:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:07:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-25 02:07:02,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:02,635 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, 1, 1] [2018-10-25 02:07:02,637 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:02,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1357695353, now seen corresponding path program 1 times [2018-10-25 02:07:02,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:02,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:02,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:02,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:02,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:03,135 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-25 02:07:03,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:03,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:07:03,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:03,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:07:03,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:07:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:07:03,166 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 4 states. [2018-10-25 02:07:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:13,361 INFO L93 Difference]: Finished difference Result 2974 states and 5747 transitions. [2018-10-25 02:07:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:07:13,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-10-25 02:07:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:13,404 INFO L225 Difference]: With dead ends: 2974 [2018-10-25 02:07:13,404 INFO L226 Difference]: Without dead ends: 2193 [2018-10-25 02:07:13,416 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-25 02:07:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-10-25 02:07:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1474. [2018-10-25 02:07:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-25 02:07:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2384 transitions. [2018-10-25 02:07:13,667 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2384 transitions. Word has length 39 [2018-10-25 02:07:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:07:13,667 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2384 transitions. [2018-10-25 02:07:13,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:07:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2384 transitions. [2018-10-25 02:07:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-25 02:07:13,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:13,674 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, 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-25 02:07:13,674 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:13,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash -947150568, now seen corresponding path program 1 times [2018-10-25 02:07:13,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:13,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:13,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:07:13,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:13,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:07:13,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:13,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:07:13,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:07:13,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:07:13,945 INFO L87 Difference]: Start difference. First operand 1474 states and 2384 transitions. Second operand 5 states. [2018-10-25 02:07:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:24,463 INFO L93 Difference]: Finished difference Result 4422 states and 7235 transitions. [2018-10-25 02:07:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:07:24,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-10-25 02:07:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:24,495 INFO L225 Difference]: With dead ends: 4422 [2018-10-25 02:07:24,496 INFO L226 Difference]: Without dead ends: 2954 [2018-10-25 02:07:24,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:07:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-10-25 02:07:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2930. [2018-10-25 02:07:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2018-10-25 02:07:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4516 transitions. [2018-10-25 02:07:24,610 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 4516 transitions. Word has length 109 [2018-10-25 02:07:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:07:24,611 INFO L481 AbstractCegarLoop]: Abstraction has 2930 states and 4516 transitions. [2018-10-25 02:07:24,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:07:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 4516 transitions. [2018-10-25 02:07:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-25 02:07:24,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:24,622 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, 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] [2018-10-25 02:07:24,622 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:24,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1923837536, now seen corresponding path program 1 times [2018-10-25 02:07:24,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:24,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:24,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:24,977 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:07:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:07:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:07:25,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:25,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:07:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:07:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:07:25,372 INFO L87 Difference]: Start difference. First operand 2930 states and 4516 transitions. Second operand 6 states. [2018-10-25 02:07:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:34,624 INFO L93 Difference]: Finished difference Result 10279 states and 16084 transitions. [2018-10-25 02:07:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:07:34,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-10-25 02:07:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:34,678 INFO L225 Difference]: With dead ends: 10279 [2018-10-25 02:07:34,678 INFO L226 Difference]: Without dead ends: 7355 [2018-10-25 02:07:34,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:07:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2018-10-25 02:07:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 7296. [2018-10-25 02:07:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2018-10-25 02:07:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 10495 transitions. [2018-10-25 02:07:34,897 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 10495 transitions. Word has length 113 [2018-10-25 02:07:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:07:34,899 INFO L481 AbstractCegarLoop]: Abstraction has 7296 states and 10495 transitions. [2018-10-25 02:07:34,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:07:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 10495 transitions. [2018-10-25 02:07:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 02:07:34,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:34,903 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:07:34,910 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:34,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 397539053, now seen corresponding path program 1 times [2018-10-25 02:07:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:34,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:34,913 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:07:35,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:35,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:07:35,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:35,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:07:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:07:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:07:35,374 INFO L87 Difference]: Start difference. First operand 7296 states and 10495 transitions. Second operand 6 states. [2018-10-25 02:07:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:43,603 INFO L93 Difference]: Finished difference Result 18993 states and 28013 transitions. [2018-10-25 02:07:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:07:43,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-10-25 02:07:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:43,655 INFO L225 Difference]: With dead ends: 18993 [2018-10-25 02:07:43,655 INFO L226 Difference]: Without dead ends: 11703 [2018-10-25 02:07:43,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:07:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2018-10-25 02:07:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 11639. [2018-10-25 02:07:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11639 states. [2018-10-25 02:07:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11639 states to 11639 states and 16002 transitions. [2018-10-25 02:07:43,972 INFO L78 Accepts]: Start accepts. Automaton has 11639 states and 16002 transitions. Word has length 134 [2018-10-25 02:07:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:07:43,973 INFO L481 AbstractCegarLoop]: Abstraction has 11639 states and 16002 transitions. [2018-10-25 02:07:43,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:07:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11639 states and 16002 transitions. [2018-10-25 02:07:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-25 02:07:43,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:43,977 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:07:43,977 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:43,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1776632544, now seen corresponding path program 1 times [2018-10-25 02:07:43,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:43,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:44,249 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:07:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:07:44,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:44,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:07:44,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:44,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:07:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:07:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:07:44,635 INFO L87 Difference]: Start difference. First operand 11639 states and 16002 transitions. Second operand 6 states. [2018-10-25 02:07:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:50,785 INFO L93 Difference]: Finished difference Result 27658 states and 38922 transitions. [2018-10-25 02:07:50,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:07:50,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2018-10-25 02:07:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:50,856 INFO L225 Difference]: With dead ends: 27658 [2018-10-25 02:07:50,856 INFO L226 Difference]: Without dead ends: 16025 [2018-10-25 02:07:50,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:07:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16025 states. [2018-10-25 02:07:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16025 to 15947. [2018-10-25 02:07:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15947 states. [2018-10-25 02:07:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15947 states to 15947 states and 19810 transitions. [2018-10-25 02:07:51,206 INFO L78 Accepts]: Start accepts. Automaton has 15947 states and 19810 transitions. Word has length 177 [2018-10-25 02:07:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:07:51,207 INFO L481 AbstractCegarLoop]: Abstraction has 15947 states and 19810 transitions. [2018-10-25 02:07:51,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:07:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 15947 states and 19810 transitions. [2018-10-25 02:07:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-25 02:07:51,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:51,213 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, 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, 1, 1, 1, 1, 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-25 02:07:51,214 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:51,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 952767299, now seen corresponding path program 1 times [2018-10-25 02:07:51,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:51,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:51,215 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-25 02:07:51,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:07:51,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:51,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:07:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:07:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:07:51,644 INFO L87 Difference]: Start difference. First operand 15947 states and 19810 transitions. Second operand 4 states. [2018-10-25 02:07:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:59,424 INFO L93 Difference]: Finished difference Result 60752 states and 78092 transitions. [2018-10-25 02:07:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:07:59,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2018-10-25 02:07:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:59,554 INFO L225 Difference]: With dead ends: 60752 [2018-10-25 02:07:59,555 INFO L226 Difference]: Without dead ends: 44811 [2018-10-25 02:07:59,634 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-25 02:07:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44811 states. [2018-10-25 02:08:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44811 to 44811. [2018-10-25 02:08:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44811 states. [2018-10-25 02:08:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44811 states to 44811 states and 55159 transitions. [2018-10-25 02:08:00,862 INFO L78 Accepts]: Start accepts. Automaton has 44811 states and 55159 transitions. Word has length 235 [2018-10-25 02:08:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:00,863 INFO L481 AbstractCegarLoop]: Abstraction has 44811 states and 55159 transitions. [2018-10-25 02:08:00,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:08:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44811 states and 55159 transitions. [2018-10-25 02:08:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-25 02:08:00,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:00,890 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-25 02:08:00,891 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:00,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1249259458, now seen corresponding path program 1 times [2018-10-25 02:08:00,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:00,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:00,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:00,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:01,275 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:08:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 59 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:01,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:08:01,864 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:08:01,865 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 301 with the following transitions: [2018-10-25 02:08:01,868 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1835], [1837], [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], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2328], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2388], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:08:01,933 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:08:01,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:08:02,576 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:08:02,579 INFO L272 AbstractInterpreter]: Visited 143 different actions 143 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:08:02,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:02,626 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:08:03,303 INFO L232 lantSequenceWeakener]: Weakened 291 states. On average, predicates are now at 77.63% of their original sizes. [2018-10-25 02:08:03,305 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:08:03,441 INFO L413 sIntCurrentIteration]: We have 299 unified AI predicates [2018-10-25 02:08:03,441 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:08:03,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:08:03,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-25 02:08:03,443 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:03,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:03,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:03,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:03,444 INFO L87 Difference]: Start difference. First operand 44811 states and 55159 transitions. Second operand 6 states. [2018-10-25 02:08:47,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:08:47,047 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 02:08:47,053 INFO L168 Benchmark]: Toolchain (without parser) took 114950.24 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 2.3 GB in the end (delta: -886.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-25 02:08:47,054 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:08:47,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1722.18 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: 150.6 MB). Peak memory consumption was 150.6 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:47,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 371.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -961.9 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:47,056 INFO L168 Benchmark]: Boogie Preprocessor took 225.76 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:47,057 INFO L168 Benchmark]: RCFGBuilder took 8068.88 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: 509.2 MB). Peak memory consumption was 509.2 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:47,058 INFO L168 Benchmark]: TraceAbstraction took 104555.82 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 2.3 GB in the end (delta: -612.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 02:08:47,064 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1722.18 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: 150.6 MB). Peak memory consumption was 150.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 371.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -961.9 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.76 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8068.88 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: 509.2 MB). Peak memory consumption was 509.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104555.82 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 2.3 GB in the end (delta: -612.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...