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/Problem12_label34_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:32:23,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:32:23,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:32:23,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:32:23,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:32:23,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:32:23,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:32:23,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:32:23,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:32:23,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:32:23,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:32:23,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:32:23,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:32:23,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:32:23,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:32:23,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:32:23,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:32:23,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:32:23,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:32:23,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:32:23,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:32:23,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:32:23,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:32:23,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:32:23,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:32:23,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:32:23,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:32:23,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:32:23,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:32:23,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:32:23,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:32:23,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:32:23,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:32:23,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:32:23,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:32:23,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:32:23,921 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:32:23,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:32:23,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:32:23,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:32:23,949 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:32:23,949 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:32:23,950 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:32:23,950 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:32:23,950 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:32:23,950 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:32:23,950 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:32:23,951 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:32:23,951 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:32:23,951 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:32:23,951 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:32:23,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:32:23,952 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:32:23,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:32:23,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:32:23,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:32:23,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:32:23,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:32:23,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:32:23,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:32:23,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:32:23,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:32:23,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:32:23,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:23,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:32:23,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:32:23,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:32:23,955 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:32:23,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:32:23,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:32:23,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:32:23,956 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:32:23,956 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:32:24,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:32:24,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:32:24,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:32:24,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:32:24,036 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:32:24,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label34_false-unreach-call.c [2018-10-24 23:32:24,101 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3684065cc/fa525c0d738d4843afef657b23e0ddcc/FLAG301ed0783 [2018-10-24 23:32:24,903 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:32:24,904 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label34_false-unreach-call.c [2018-10-24 23:32:24,933 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3684065cc/fa525c0d738d4843afef657b23e0ddcc/FLAG301ed0783 [2018-10-24 23:32:24,951 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3684065cc/fa525c0d738d4843afef657b23e0ddcc [2018-10-24 23:32:24,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:32:24,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:32:24,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:24,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:32:24,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:32:24,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:24" (1/1) ... [2018-10-24 23:32:24,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb5160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:24, skipping insertion in model container [2018-10-24 23:32:24,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:24" (1/1) ... [2018-10-24 23:32:24,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:32:25,162 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:32:26,546 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:26,553 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:32:27,080 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:27,115 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:32:27,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27 WrapperNode [2018-10-24 23:32:27,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:27,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:27,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:32:27,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:32:27,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:27,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:32:27,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:32:27,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:32:27,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... [2018-10-24 23:32:27,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:32:27,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:32:27,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:32:27,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:32:27,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:32:27,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:32:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:32:27,998 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:32:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:32:27,999 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:32:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:32:27,999 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:32:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:32:28,000 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:32:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:32:28,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:32:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:32:28,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:32:38,908 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:32:38,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:38 BoogieIcfgContainer [2018-10-24 23:32:38,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:32:38,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:32:38,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:32:38,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:32:38,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:32:24" (1/3) ... [2018-10-24 23:32:38,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39561ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:38, skipping insertion in model container [2018-10-24 23:32:38,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:27" (2/3) ... [2018-10-24 23:32:38,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39561ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:38, skipping insertion in model container [2018-10-24 23:32:38,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:38" (3/3) ... [2018-10-24 23:32:38,917 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label34_false-unreach-call.c [2018-10-24 23:32:38,926 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:32:38,936 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:32:38,953 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:32:38,999 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:32:39,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:32:39,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:32:39,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:32:39,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:32:39,000 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:32:39,000 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:32:39,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:32:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:32:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 23:32:39,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:39,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:32:39,078 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:39,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1388139973, now seen corresponding path program 1 times [2018-10-24 23:32:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:39,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:39,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:39,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:39,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:32:39,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:39,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:32:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:32:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:32:39,607 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-10-24 23:32:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:56,266 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-10-24 23:32:56,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:32:56,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-24 23:32:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:56,320 INFO L225 Difference]: With dead ends: 3234 [2018-10-24 23:32:56,320 INFO L226 Difference]: Without dead ends: 2388 [2018-10-24 23:32:56,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:32:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-24 23:32:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2018-10-24 23:32:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2018-10-24 23:32:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4022 transitions. [2018-10-24 23:32:56,539 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4022 transitions. Word has length 23 [2018-10-24 23:32:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:56,540 INFO L481 AbstractCegarLoop]: Abstraction has 2388 states and 4022 transitions. [2018-10-24 23:32:56,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:32:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4022 transitions. [2018-10-24 23:32:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-24 23:32:56,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:56,548 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:32:56,548 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:56,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:56,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1150464296, now seen corresponding path program 1 times [2018-10-24 23:32:56,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:56,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:56,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:56,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:56,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:56,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:56,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:32:56,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:56,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:32:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:32:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:56,935 INFO L87 Difference]: Start difference. First operand 2388 states and 4022 transitions. Second operand 6 states. [2018-10-24 23:33:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:12,576 INFO L93 Difference]: Finished difference Result 9453 states and 16261 transitions. [2018-10-24 23:33:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:12,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-10-24 23:33:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:12,631 INFO L225 Difference]: With dead ends: 9453 [2018-10-24 23:33:12,632 INFO L226 Difference]: Without dead ends: 7071 [2018-10-24 23:33:12,645 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-24 23:33:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2018-10-24 23:33:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7023. [2018-10-24 23:33:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2018-10-24 23:33:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 10536 transitions. [2018-10-24 23:33:12,828 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 10536 transitions. Word has length 123 [2018-10-24 23:33:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:12,828 INFO L481 AbstractCegarLoop]: Abstraction has 7023 states and 10536 transitions. [2018-10-24 23:33:12,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 10536 transitions. [2018-10-24 23:33:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 23:33:12,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:12,837 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:12,838 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:12,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash -521586516, now seen corresponding path program 1 times [2018-10-24 23:33:12,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:12,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:12,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:13,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:13,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:33:13,065 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:13,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:33:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:33:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:13,067 INFO L87 Difference]: Start difference. First operand 7023 states and 10536 transitions. Second operand 4 states. [2018-10-24 23:33:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:23,568 INFO L93 Difference]: Finished difference Result 27807 states and 43318 transitions. [2018-10-24 23:33:23,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:33:23,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-24 23:33:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:23,686 INFO L225 Difference]: With dead ends: 27807 [2018-10-24 23:33:23,686 INFO L226 Difference]: Without dead ends: 20790 [2018-10-24 23:33:23,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20790 states. [2018-10-24 23:33:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20790 to 20790. [2018-10-24 23:33:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20790 states. [2018-10-24 23:33:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20790 states to 20790 states and 31070 transitions. [2018-10-24 23:33:24,248 INFO L78 Accepts]: Start accepts. Automaton has 20790 states and 31070 transitions. Word has length 173 [2018-10-24 23:33:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:24,249 INFO L481 AbstractCegarLoop]: Abstraction has 20790 states and 31070 transitions. [2018-10-24 23:33:24,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:33:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 20790 states and 31070 transitions. [2018-10-24 23:33:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-24 23:33:24,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:24,278 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:33:24,278 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:24,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:24,279 INFO L82 PathProgramCache]: Analyzing trace with hash 640704029, now seen corresponding path program 1 times [2018-10-24 23:33:24,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:24,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-24 23:33:24,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:24,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:33:24,689 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:24,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:33:24,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:33:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:24,691 INFO L87 Difference]: Start difference. First operand 20790 states and 31070 transitions. Second operand 4 states. [2018-10-24 23:33:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:36,080 INFO L93 Difference]: Finished difference Result 75182 states and 120688 transitions. [2018-10-24 23:33:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:33:36,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2018-10-24 23:33:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:36,414 INFO L225 Difference]: With dead ends: 75182 [2018-10-24 23:33:36,414 INFO L226 Difference]: Without dead ends: 54398 [2018-10-24 23:33:36,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54398 states. [2018-10-24 23:33:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54398 to 54395. [2018-10-24 23:33:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54395 states. [2018-10-24 23:33:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54395 states to 54395 states and 80117 transitions. [2018-10-24 23:33:37,792 INFO L78 Accepts]: Start accepts. Automaton has 54395 states and 80117 transitions. Word has length 291 [2018-10-24 23:33:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:37,793 INFO L481 AbstractCegarLoop]: Abstraction has 54395 states and 80117 transitions. [2018-10-24 23:33:37,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:33:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 54395 states and 80117 transitions. [2018-10-24 23:33:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-24 23:33:37,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:37,845 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:37,845 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:37,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:37,845 INFO L82 PathProgramCache]: Analyzing trace with hash -627152535, now seen corresponding path program 1 times [2018-10-24 23:33:37,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:37,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:37,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:37,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:38,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:38,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:33:38,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:38,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:33:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:33:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:33:38,320 INFO L87 Difference]: Start difference. First operand 54395 states and 80117 transitions. Second operand 5 states. [2018-10-24 23:33:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:49,926 INFO L93 Difference]: Finished difference Result 162657 states and 253697 transitions. [2018-10-24 23:33:49,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:49,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2018-10-24 23:33:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:50,499 INFO L225 Difference]: With dead ends: 162657 [2018-10-24 23:33:50,500 INFO L226 Difference]: Without dead ends: 108268 [2018-10-24 23:33:50,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:33:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108268 states. [2018-10-24 23:33:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108268 to 107287. [2018-10-24 23:33:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107287 states. [2018-10-24 23:33:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107287 states to 107287 states and 156044 transitions. [2018-10-24 23:33:53,688 INFO L78 Accepts]: Start accepts. Automaton has 107287 states and 156044 transitions. Word has length 292 [2018-10-24 23:33:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:53,688 INFO L481 AbstractCegarLoop]: Abstraction has 107287 states and 156044 transitions. [2018-10-24 23:33:53,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:33:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 107287 states and 156044 transitions. [2018-10-24 23:33:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-24 23:33:53,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:53,789 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:53,789 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:53,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash 123415015, now seen corresponding path program 1 times [2018-10-24 23:33:53,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:53,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:53,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:54,119 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 98 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:33:54,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:33:54,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:33:54,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 396 with the following transitions: [2018-10-24 23:33:54,647 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1951], [1953], [1956], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2492], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2797], [2801], [2805], [2809], [2813], [2817], [2821], [2825], [2829], [2833], [2837], [2841], [2845], [2849], [2853], [2857], [2861], [2865], [2869], [2873], [2877], [2881], [2885], [2889], [2893], [2897], [2901], [2905], [2909], [2913], [2917], [2921], [2925], [2929], [2933], [2937], [2941], [2945], [2949], [2953], [2957], [2961], [2965], [2969], [2973], [2977], [2981], [2985], [2989], [2993], [2997], [3001], [3005], [3009], [3013], [3017], [3021], [3025], [3029], [3033], [3037], [3041], [3045], [3049], [3053], [3057], [3061], [3065], [3069], [3073], [3077], [3081], [3085], [3089], [3093], [3097], [3101], [3105], [3109], [3113], [3117], [3121], [3125], [3129], [3133], [3137], [3141], [3145], [3149], [3153], [3156], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:33:54,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:33:54,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:33:55,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:33:55,685 INFO L272 AbstractInterpreter]: Visited 274 different actions 274 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:33:55,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:55,729 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:33:56,675 INFO L232 lantSequenceWeakener]: Weakened 386 states. On average, predicates are now at 75.03% of their original sizes. [2018-10-24 23:33:56,676 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:33:56,944 INFO L413 sIntCurrentIteration]: We have 394 unified AI predicates [2018-10-24 23:33:56,944 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:33:56,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:33:56,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:33:56,946 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:56,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:56,948 INFO L87 Difference]: Start difference. First operand 107287 states and 156044 transitions. Second operand 6 states. [2018-10-24 23:34:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:34:18,290 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:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:34:18,298 INFO L168 Benchmark]: Toolchain (without parser) took 113334.52 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -702.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-24 23:34:18,299 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:34:18,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2149.54 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: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:18,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 519.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:18,302 INFO L168 Benchmark]: Boogie Preprocessor took 285.94 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: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:18,302 INFO L168 Benchmark]: RCFGBuilder took 10985.84 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 178.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -177.1 MB). Peak memory consumption was 667.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:18,303 INFO L168 Benchmark]: TraceAbstraction took 99386.91 ms. Allocated memory was 2.5 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.1 GB in the end (delta: 275.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-24 23:34:18,309 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.23 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 2149.54 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: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 519.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 285.94 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: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10985.84 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 178.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -177.1 MB). Peak memory consumption was 667.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99386.91 ms. Allocated memory was 2.5 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.1 GB in the end (delta: 275.1 MB). Peak memory consumption was 1.7 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...