java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:42:57,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:42:57,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:42:57,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:42:57,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:42:57,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:42:57,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:42:57,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:42:57,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:42:57,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:42:57,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:42:57,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:42:57,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:42:57,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:42:57,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:42:57,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:42:57,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:42:57,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:42:57,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:42:57,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:42:57,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:42:57,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:42:57,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:42:57,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:42:57,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:42:57,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:42:57,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:42:57,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:42:57,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:42:57,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:42:57,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:42:57,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:42:57,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:42:57,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:42:57,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:42:57,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:42:57,117 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 01:42:57,133 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:42:57,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:42:57,134 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:42:57,134 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:42:57,134 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:42:57,134 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:42:57,135 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:42:57,135 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:42:57,135 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:42:57,135 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:42:57,135 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:42:57,136 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:42:57,136 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:42:57,136 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:42:57,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:42:57,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:42:57,137 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:42:57,137 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:42:57,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:42:57,138 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:42:57,138 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:42:57,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:42:57,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:42:57,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:42:57,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:42:57,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:42:57,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:42:57,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:42:57,140 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:42:57,140 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:42:57,140 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:42:57,140 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:42:57,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:42:57,141 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:42:57,141 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:42:57,141 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:42:57,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:42:57,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:42:57,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:42:57,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:42:57,213 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:42:57,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c [2018-10-25 01:42:57,273 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/de1b3d2e5/9a0bdc7d4cbe4b41b66ea9dde5a1c90b/FLAG17b438323 [2018-10-25 01:42:58,131 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:42:58,132 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c [2018-10-25 01:42:58,171 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/de1b3d2e5/9a0bdc7d4cbe4b41b66ea9dde5a1c90b/FLAG17b438323 [2018-10-25 01:42:58,186 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/de1b3d2e5/9a0bdc7d4cbe4b41b66ea9dde5a1c90b [2018-10-25 01:42:58,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:42:58,202 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:42:58,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:42:58,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:42:58,212 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:42:58,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:42:58" (1/1) ... [2018-10-25 01:42:58,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d1fe75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:58, skipping insertion in model container [2018-10-25 01:42:58,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:42:58" (1/1) ... [2018-10-25 01:42:58,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:42:58,434 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:43:00,036 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:43:00,045 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:43:00,768 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:43:00,808 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:43:00,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00 WrapperNode [2018-10-25 01:43:00,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:43:00,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:43:00,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:43:00,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:43:00,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:00,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:43:01,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:43:01,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:43:01,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:43:01,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (1/1) ... [2018-10-25 01:43:01,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:43:01,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:43:01,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:43:01,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:43:01,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (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 01:43:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:43:01,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:43:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:43:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:43:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:43:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:43:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:43:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:43:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:43:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:43:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:43:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:43:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:43:01,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:43:12,795 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:43:12,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:43:12 BoogieIcfgContainer [2018-10-25 01:43:12,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:43:12,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:43:12,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:43:12,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:43:12,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:42:58" (1/3) ... [2018-10-25 01:43:12,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16400f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:43:12, skipping insertion in model container [2018-10-25 01:43:12,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:00" (2/3) ... [2018-10-25 01:43:12,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16400f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:43:12, skipping insertion in model container [2018-10-25 01:43:12,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:43:12" (3/3) ... [2018-10-25 01:43:12,804 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label34_true-unreach-call.c [2018-10-25 01:43:12,814 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:43:12,824 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:43:12,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:43:12,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:43:12,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:43:12,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:43:12,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:43:12,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:43:12,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:43:12,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:43:12,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:43:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:43:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-25 01:43:12,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:12,942 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, 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 01:43:12,945 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:12,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash 784010707, now seen corresponding path program 1 times [2018-10-25 01:43:12,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:13,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:13,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:13,480 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:13,546 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 01:43:13,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:13,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:43:13,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:13,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:43:13,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:43:13,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:43:13,574 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:43:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:23,835 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-10-25 01:43:23,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:43:23,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-25 01:43:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:23,876 INFO L225 Difference]: With dead ends: 3093 [2018-10-25 01:43:23,876 INFO L226 Difference]: Without dead ends: 1971 [2018-10-25 01:43:23,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:43:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-10-25 01:43:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-10-25 01:43:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-10-25 01:43:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-10-25 01:43:24,089 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 63 [2018-10-25 01:43:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:24,090 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-10-25 01:43:24,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:43:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-10-25 01:43:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-25 01:43:24,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:24,101 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, 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] [2018-10-25 01:43:24,101 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:24,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -666764916, now seen corresponding path program 1 times [2018-10-25 01:43:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:24,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:24,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:24,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:24,561 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:24,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:24,564 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-10-25 01:43:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:37,892 INFO L93 Difference]: Finished difference Result 5627 states and 10356 transitions. [2018-10-25 01:43:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:37,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-10-25 01:43:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:37,916 INFO L225 Difference]: With dead ends: 5627 [2018-10-25 01:43:37,917 INFO L226 Difference]: Without dead ends: 3676 [2018-10-25 01:43:37,924 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-25 01:43:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2018-10-25 01:43:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3643. [2018-10-25 01:43:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-10-25 01:43:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5987 transitions. [2018-10-25 01:43:38,027 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5987 transitions. Word has length 146 [2018-10-25 01:43:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:38,028 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 5987 transitions. [2018-10-25 01:43:38,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5987 transitions. [2018-10-25 01:43:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-25 01:43:38,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:38,041 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, 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] [2018-10-25 01:43:38,041 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:38,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -646191812, now seen corresponding path program 1 times [2018-10-25 01:43:38,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:38,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:38,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:38,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:38,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:43:38,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:38,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:43:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:43:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:43:38,320 INFO L87 Difference]: Start difference. First operand 3643 states and 5987 transitions. Second operand 5 states. [2018-10-25 01:43:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:54,779 INFO L93 Difference]: Finished difference Result 10957 states and 18516 transitions. [2018-10-25 01:43:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:43:54,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-10-25 01:43:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:54,834 INFO L225 Difference]: With dead ends: 10957 [2018-10-25 01:43:54,834 INFO L226 Difference]: Without dead ends: 7320 [2018-10-25 01:43:54,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:43:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2018-10-25 01:43:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7131. [2018-10-25 01:43:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7131 states. [2018-10-25 01:43:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7131 states to 7131 states and 10923 transitions. [2018-10-25 01:43:55,078 INFO L78 Accepts]: Start accepts. Automaton has 7131 states and 10923 transitions. Word has length 162 [2018-10-25 01:43:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:55,079 INFO L481 AbstractCegarLoop]: Abstraction has 7131 states and 10923 transitions. [2018-10-25 01:43:55,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:43:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7131 states and 10923 transitions. [2018-10-25 01:43:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-25 01:43:55,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:55,089 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, 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-25 01:43:55,090 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:55,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1378098232, now seen corresponding path program 1 times [2018-10-25 01:43:55,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:55,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:55,454 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:55,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:55,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:55,906 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:55,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:55,907 INFO L87 Difference]: Start difference. First operand 7131 states and 10923 transitions. Second operand 6 states. [2018-10-25 01:44:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:07,516 INFO L93 Difference]: Finished difference Result 19766 states and 31245 transitions. [2018-10-25 01:44:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:44:07,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2018-10-25 01:44:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:07,593 INFO L225 Difference]: With dead ends: 19766 [2018-10-25 01:44:07,593 INFO L226 Difference]: Without dead ends: 12641 [2018-10-25 01:44:07,634 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 01:44:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12641 states. [2018-10-25 01:44:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12641 to 12439. [2018-10-25 01:44:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12439 states. [2018-10-25 01:44:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 18019 transitions. [2018-10-25 01:44:07,954 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 18019 transitions. Word has length 199 [2018-10-25 01:44:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:07,955 INFO L481 AbstractCegarLoop]: Abstraction has 12439 states and 18019 transitions. [2018-10-25 01:44:07,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:44:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 18019 transitions. [2018-10-25 01:44:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-25 01:44:07,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:07,963 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, 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] [2018-10-25 01:44:07,963 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:07,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1937080759, now seen corresponding path program 1 times [2018-10-25 01:44:07,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:07,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:07,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:08,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:08,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:44:08,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:08,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:08,326 INFO L87 Difference]: Start difference. First operand 12439 states and 18019 transitions. Second operand 6 states. [2018-10-25 01:44:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:24,617 INFO L93 Difference]: Finished difference Result 42949 states and 69054 transitions. [2018-10-25 01:44:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:44:24,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 221 [2018-10-25 01:44:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:24,771 INFO L225 Difference]: With dead ends: 42949 [2018-10-25 01:44:24,772 INFO L226 Difference]: Without dead ends: 30516 [2018-10-25 01:44:24,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:44:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30516 states. [2018-10-25 01:44:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30516 to 30278. [2018-10-25 01:44:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30278 states. [2018-10-25 01:44:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30278 states to 30278 states and 43651 transitions. [2018-10-25 01:44:25,810 INFO L78 Accepts]: Start accepts. Automaton has 30278 states and 43651 transitions. Word has length 221 [2018-10-25 01:44:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:25,811 INFO L481 AbstractCegarLoop]: Abstraction has 30278 states and 43651 transitions. [2018-10-25 01:44:25,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:44:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 30278 states and 43651 transitions. [2018-10-25 01:44:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-25 01:44:25,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:25,830 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:44:25,830 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:25,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash 830569225, now seen corresponding path program 1 times [2018-10-25 01:44:25,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:25,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:26,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:44:26,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:44:26,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-10-25 01:44:26,809 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3031], [3033], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3171], [3176], [3178], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:44:26,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:44:26,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:44:27,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:44:27,450 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:44:27,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:27,493 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:44:28,095 INFO L232 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 71.47% of their original sizes. [2018-10-25 01:44:28,096 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:44:28,366 INFO L413 sIntCurrentIteration]: We have 266 unified AI predicates [2018-10-25 01:44:28,366 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:44:28,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:44:28,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:44:28,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:28,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:28,369 INFO L87 Difference]: Start difference. First operand 30278 states and 43651 transitions. Second operand 6 states. [2018-10-25 01:44:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:44:32,930 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:44:32,936 INFO L168 Benchmark]: Toolchain (without parser) took 94734.88 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 571.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,937 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 01:44:32,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2605.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 644.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 810.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,940 INFO L168 Benchmark]: Boogie Preprocessor took 312.39 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,941 INFO L168 Benchmark]: RCFGBuilder took 11028.63 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 206.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -29.9 MB). Peak memory consumption was 678.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,942 INFO L168 Benchmark]: TraceAbstraction took 80138.07 ms. Allocated memory was 2.6 GB in the beginning and 3.1 GB in the end (delta: 567.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -195.1 MB). Peak memory consumption was 372.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,948 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 2605.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 644.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 810.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 312.39 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11028.63 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 206.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -29.9 MB). Peak memory consumption was 678.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80138.07 ms. Allocated memory was 2.6 GB in the beginning and 3.1 GB in the end (delta: 567.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -195.1 MB). Peak memory consumption was 372.2 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...