java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label06_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:38:58,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:38:58,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:38:58,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:38:58,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:38:58,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:38:58,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:38:58,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:38:58,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:38:58,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:38:58,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:38:58,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:38:58,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:38:58,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:38:58,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:38:58,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:38:58,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:38:58,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:38:58,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:38:58,928 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:38:58,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:38:58,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:38:58,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:38:58,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:38:58,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:38:58,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:38:58,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:38:58,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:38:58,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:38:58,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:38:58,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:38:58,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:38:58,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:38:58,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:38:58,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:38:58,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:38:58,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:38:58,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:38:58,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:38:58,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:38:58,977 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:38:58,978 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:38:58,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:38:58,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:38:58,978 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:38:58,978 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:38:58,979 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:38:58,979 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:38:58,979 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:38:58,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:38:58,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:38:58,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:38:58,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:38:58,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:38:58,984 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:38:58,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:38:58,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:38:58,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:38:58,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:38:58,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:38:58,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:38:58,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:38:58,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:38:58,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:38:58,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:38:58,987 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:38:58,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:38:58,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:38:58,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:38:58,988 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:38:58,988 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:38:59,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:38:59,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:38:59,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:38:59,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:38:59,075 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:38:59,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label06_true-unreach-call.c [2018-09-19 12:38:59,442 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60bf09521/bf6198ace35a45758129bf73b08a9f98/FLAGaac4f708b [2018-09-19 12:38:59,733 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:38:59,737 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label06_true-unreach-call.c [2018-09-19 12:38:59,759 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60bf09521/bf6198ace35a45758129bf73b08a9f98/FLAGaac4f708b [2018-09-19 12:38:59,777 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60bf09521/bf6198ace35a45758129bf73b08a9f98 [2018-09-19 12:38:59,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:38:59,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:38:59,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:38:59,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:38:59,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:38:59,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:38:59" (1/1) ... [2018-09-19 12:38:59,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32233f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:38:59, skipping insertion in model container [2018-09-19 12:38:59,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:38:59" (1/1) ... [2018-09-19 12:38:59,815 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:39:00,313 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:39:00,330 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:39:00,455 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:39:00,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00 WrapperNode [2018-09-19 12:39:00,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:39:00,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:39:00,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:39:00,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:39:00,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:39:00,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:39:00,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:39:00,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:39:00,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... [2018-09-19 12:39:00,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:39:00,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:39:00,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:39:00,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:39:00,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-09-19 12:39:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:39:00,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:39:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:39:00,959 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:39:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:39:00,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:39:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:39:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:39:04,281 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:39:04,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:39:04 BoogieIcfgContainer [2018-09-19 12:39:04,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:39:04,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:39:04,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:39:04,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:39:04,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:38:59" (1/3) ... [2018-09-19 12:39:04,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70b0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:39:04, skipping insertion in model container [2018-09-19 12:39:04,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:00" (2/3) ... [2018-09-19 12:39:04,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70b0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:39:04, skipping insertion in model container [2018-09-19 12:39:04,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:39:04" (3/3) ... [2018-09-19 12:39:04,294 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label06_true-unreach-call.c [2018-09-19 12:39:04,307 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:39:04,318 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:39:04,374 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:39:04,375 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:39:04,376 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:39:04,376 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:39:04,376 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:39:04,376 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:39:04,376 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:39:04,376 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:39:04,377 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:39:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:39:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 12:39:04,410 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:04,412 INFO L376 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] [2018-09-19 12:39:04,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1783356911, now seen corresponding path program 1 times [2018-09-19 12:39:04,421 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:04,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-09-19 12:39:04,425 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:39:04,467 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:04,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:04,720 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:04,721 INFO L272 AbstractInterpreter]: Visited 30 different actions 30 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:39:04,737 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:04,909 INFO L232 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-19 12:39:04,909 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:05,154 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:05,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:05,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:39:05,158 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:05,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:39:05,172 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:39:05,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:39:05,175 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:39:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:07,647 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:39:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:39:07,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-09-19 12:39:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:07,666 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:39:07,666 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:39:07,675 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:39:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:39:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:39:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:39:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:39:07,752 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 31 [2018-09-19 12:39:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:39:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:39:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:39:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-19 12:39:07,758 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:07,759 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 12:39:07,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash 228974179, now seen corresponding path program 1 times [2018-09-19 12:39:07,760 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:07,760 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2018-09-19 12:39:07,761 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:07,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:07,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:07,928 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:08,123 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:08,124 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:08,166 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:08,469 INFO L232 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 73.08% of their original sizes. [2018-09-19 12:39:08,470 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:08,820 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:08,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:08,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:08,821 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:08,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:08,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:08,823 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:08,824 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:39:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:12,984 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:39:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:12,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-09-19 12:39:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:12,993 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:39:12,993 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:39:12,997 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:39:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:39:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:39:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:39:13,030 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 102 [2018-09-19 12:39:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:13,030 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:39:13,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:39:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-19 12:39:13,034 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:13,034 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 12:39:13,034 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 812548124, now seen corresponding path program 1 times [2018-09-19 12:39:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:13,035 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2018-09-19 12:39:13,035 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:13,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:13,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:13,115 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:13,224 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:13,225 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:13,261 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:13,453 INFO L232 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 73.05% of their original sizes. [2018-09-19 12:39:13,454 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:14,233 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:14,234 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:14,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:14,234 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:14,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:14,235 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:14,236 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:14,236 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:39:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:17,851 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:39:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:17,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2018-09-19 12:39:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:17,857 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:39:17,858 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:39:17,860 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:39:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:39:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:39:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:39:17,896 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 111 [2018-09-19 12:39:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:17,897 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:39:17,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:39:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-19 12:39:17,901 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:17,902 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 12:39:17,902 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1611542820, now seen corresponding path program 1 times [2018-09-19 12:39:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:17,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-19 12:39:17,903 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:17,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:17,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:18,013 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:18,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:18,216 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:18,256 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:18,523 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 72.97% of their original sizes. [2018-09-19 12:39:18,523 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:19,017 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:19,018 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:19,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:19,019 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:19,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:19,020 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:19,020 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:19,021 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:39:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:22,303 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:39:22,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:22,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2018-09-19 12:39:22,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:22,310 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:39:22,310 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:39:22,313 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:39:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:39:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:39:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:39:22,345 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 147 [2018-09-19 12:39:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:22,346 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:39:22,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:39:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-19 12:39:22,350 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:22,350 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 12:39:22,351 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1713093917, now seen corresponding path program 1 times [2018-09-19 12:39:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:22,351 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-09-19 12:39:22,352 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:22,357 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:22,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:22,593 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:22,593 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:22,625 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:22,806 INFO L232 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 72.94% of their original sizes. [2018-09-19 12:39:22,807 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:23,038 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:23,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:23,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:23,039 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:23,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:23,040 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:23,040 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:23,040 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:39:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:24,635 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:39:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:24,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2018-09-19 12:39:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:24,646 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:39:24,647 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:39:24,650 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:39:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:39:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:39:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:39:24,696 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 166 [2018-09-19 12:39:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:24,697 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:39:24,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:39:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-19 12:39:24,701 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:24,701 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:24,702 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1151580506, now seen corresponding path program 1 times [2018-09-19 12:39:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:24,702 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-09-19 12:39:24,703 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:24,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:24,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:24,767 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:24,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:24,869 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:24,905 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:25,082 INFO L232 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 72.98% of their original sizes. [2018-09-19 12:39:25,082 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:25,777 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:25,777 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:25,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:25,777 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:25,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:25,778 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:25,778 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:25,778 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:39:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:27,972 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:39:27,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:27,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2018-09-19 12:39:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:27,990 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:39:27,990 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:39:27,999 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:39:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:39:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:39:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:39:28,056 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 178 [2018-09-19 12:39:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:28,057 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:39:28,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:39:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-19 12:39:28,060 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:28,061 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:28,061 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1928262692, now seen corresponding path program 1 times [2018-09-19 12:39:28,061 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:28,062 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-19 12:39:28,062 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:28,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:28,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:28,112 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:28,210 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:28,211 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:28,244 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:28,423 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 72.97% of their original sizes. [2018-09-19 12:39:28,423 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:28,573 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:28,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:28,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:28,574 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:28,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:28,575 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:28,575 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:28,575 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:39:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:31,316 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:39:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:31,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-09-19 12:39:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:31,335 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:39:31,336 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:39:31,339 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:39:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:39:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:39:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:39:31,390 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 184 [2018-09-19 12:39:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:31,390 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:39:31,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:39:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-19 12:39:31,394 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:31,395 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:31,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -246547069, now seen corresponding path program 1 times [2018-09-19 12:39:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:31,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-09-19 12:39:31,396 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:31,398 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:31,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:31,448 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:31,579 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:31,580 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:31,586 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:31,776 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 72.97% of their original sizes. [2018-09-19 12:39:31,776 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:31,979 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:31,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:31,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:31,979 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:31,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:31,980 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:31,980 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:31,980 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:39:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:34,613 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:39:34,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:34,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-09-19 12:39:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:34,634 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:39:34,634 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:39:34,639 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:39:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:39:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:39:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:39:34,709 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 189 [2018-09-19 12:39:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:34,710 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:39:34,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:39:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-19 12:39:34,715 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:34,715 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:34,715 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1083995445, now seen corresponding path program 1 times [2018-09-19 12:39:34,716 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:34,716 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-09-19 12:39:34,716 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:34,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:34,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:34,765 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:34,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:34,930 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:34,966 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:35,163 INFO L232 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 72.96% of their original sizes. [2018-09-19 12:39:35,163 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:35,290 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:35,291 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:35,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:35,291 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:35,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:35,291 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:35,292 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:35,292 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:39:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:37,637 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:39:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:37,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2018-09-19 12:39:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:37,652 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:39:37,652 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:39:37,658 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:39:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:39:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:39:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:39:37,742 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 193 [2018-09-19 12:39:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:37,744 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:39:37,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:39:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-19 12:39:37,750 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:37,750 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:37,750 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1288836425, now seen corresponding path program 1 times [2018-09-19 12:39:37,751 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:37,751 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-19 12:39:37,751 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:37,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:37,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:37,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:42,987 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:42,988 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:42,992 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:44,509 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 72.95% of their original sizes. [2018-09-19 12:39:44,509 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:44,605 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:44,606 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:44,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:44,606 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:44,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:44,606 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:44,607 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:44,607 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:39:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:48,100 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:39:48,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:48,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-09-19 12:39:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:48,120 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:39:48,120 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:39:48,128 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:39:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:39:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:39:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:39:48,242 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 199 [2018-09-19 12:39:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:48,242 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:39:48,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:39:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-19 12:39:48,247 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:48,248 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:48,248 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1157946312, now seen corresponding path program 1 times [2018-09-19 12:39:48,248 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:48,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-09-19 12:39:48,249 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:48,251 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:48,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:48,294 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:48,521 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:48,521 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:48,556 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:48,884 INFO L232 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 72.94% of their original sizes. [2018-09-19 12:39:48,884 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:49,103 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:49,104 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:49,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:49,104 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:49,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:49,105 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:49,105 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:49,105 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:39:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:53,277 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:39:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:53,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-09-19 12:39:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:53,304 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:39:53,304 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:39:53,314 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:39:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:39:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:39:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:39:53,427 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 214 [2018-09-19 12:39:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:53,428 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:39:53,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:39:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 12:39:53,434 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:53,434 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:53,434 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:53,435 INFO L82 PathProgramCache]: Analyzing trace with hash -401062956, now seen corresponding path program 1 times [2018-09-19 12:39:53,435 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:53,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 12:39:53,435 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:53,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:53,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:53,513 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:53,736 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:53,736 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:53,776 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:53,970 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 72.93% of their original sizes. [2018-09-19 12:39:53,970 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:54,065 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:54,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:54,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:54,066 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:54,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:54,066 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:54,067 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:54,067 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:39:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:55,773 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:39:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:55,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 12:39:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:55,806 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:39:55,806 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:39:55,818 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:39:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:39:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:39:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:39:55,928 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 220 [2018-09-19 12:39:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:55,929 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:39:55,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:39:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-19 12:39:55,935 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:55,935 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:55,936 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1302849475, now seen corresponding path program 1 times [2018-09-19 12:39:55,936 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:55,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-09-19 12:39:55,937 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:55,939 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:55,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:55,981 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:56,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:56,260 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:56,299 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:56,535 INFO L232 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 72.93% of their original sizes. [2018-09-19 12:39:56,536 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:56,633 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:56,633 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:56,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:56,633 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:56,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:56,634 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:56,634 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:56,634 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:39:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:59,695 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:39:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:59,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-09-19 12:39:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:59,724 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:39:59,724 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:39:59,737 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:39:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:39:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:39:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:39:59,866 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 221 [2018-09-19 12:39:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:59,867 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:39:59,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:39:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-19 12:39:59,879 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:59,879 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:59,879 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:59,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1852428803, now seen corresponding path program 1 times [2018-09-19 12:39:59,880 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:59,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-09-19 12:39:59,880 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:59,883 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:59,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:59,927 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:00,242 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:00,242 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:40:00,270 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:00,556 INFO L232 lantSequenceWeakener]: Weakened 250 states. On average, predicates are now at 72.91% of their original sizes. [2018-09-19 12:40:00,562 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:00,698 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:00,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:00,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:00,699 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:00,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:00,699 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:00,699 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:00,700 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:40:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:03,873 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:40:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:03,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 253 [2018-09-19 12:40:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:03,902 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:40:03,902 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:40:03,916 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:40:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:40:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:40:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:40:04,090 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 253 [2018-09-19 12:40:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:04,091 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:40:04,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:40:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-19 12:40:04,102 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:04,103 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:04,103 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1674941867, now seen corresponding path program 1 times [2018-09-19 12:40:04,104 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:04,104 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-09-19 12:40:04,104 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:04,106 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:04,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:04,148 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:04,319 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:04,319 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:04,328 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:04,535 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 72.93% of their original sizes. [2018-09-19 12:40:04,535 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:04,639 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:04,639 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:04,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:04,640 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:04,640 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:04,640 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:04,641 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:40:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:08,269 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:40:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:08,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 262 [2018-09-19 12:40:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:08,322 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:40:08,322 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:40:08,342 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:40:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:40:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:40:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:40:08,580 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 262 [2018-09-19 12:40:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:08,581 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:40:08,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:40:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-19 12:40:08,599 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:08,599 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:08,599 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:08,600 INFO L82 PathProgramCache]: Analyzing trace with hash -97982235, now seen corresponding path program 1 times [2018-09-19 12:40:08,600 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:08,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-09-19 12:40:08,600 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:08,602 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:08,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:08,659 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:08,847 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:08,847 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:08,883 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:09,164 INFO L232 lantSequenceWeakener]: Weakened 267 states. On average, predicates are now at 72.93% of their original sizes. [2018-09-19 12:40:09,164 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:09,665 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:09,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:09,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:09,665 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:09,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:09,666 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:09,666 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:09,666 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:40:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:12,488 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:40:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:40:12,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2018-09-19 12:40:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:12,523 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:40:12,523 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:40:12,541 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:40:12,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:40:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:40:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:40:12,754 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 270 [2018-09-19 12:40:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:12,755 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:40:12,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:40:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-19 12:40:12,770 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:12,771 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:12,771 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -222316639, now seen corresponding path program 1 times [2018-09-19 12:40:12,771 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:12,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-09-19 12:40:12,772 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:12,774 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:12,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:12,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:18,006 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:18,006 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:18,029 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:19,652 INFO L232 lantSequenceWeakener]: Weakened 269 states. On average, predicates are now at 72.93% of their original sizes. [2018-09-19 12:40:19,652 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:19,739 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:19,739 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:19,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:19,740 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:19,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:19,740 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:19,740 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:19,741 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:40:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:22,594 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:40:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:22,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 272 [2018-09-19 12:40:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:22,623 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:40:22,623 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:40:22,645 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 279 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:40:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:40:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:40:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:40:22,940 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 272 [2018-09-19 12:40:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:22,941 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:40:22,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:40:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-09-19 12:40:22,959 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:22,960 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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-09-19 12:40:22,960 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1397032728, now seen corresponding path program 1 times [2018-09-19 12:40:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:22,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-09-19 12:40:22,961 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:22,965 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:22,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:23,016 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:23,346 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:23,346 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:23,356 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:23,556 INFO L232 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 72.92% of their original sizes. [2018-09-19 12:40:23,556 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:23,651 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:23,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:23,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:23,651 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:23,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:23,652 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:23,652 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:23,652 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:40:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:26,072 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:40:26,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:26,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 279 [2018-09-19 12:40:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:26,106 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:40:26,106 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:40:26,124 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:26,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:40:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:40:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:40:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:40:26,369 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 279 [2018-09-19 12:40:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:26,370 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:40:26,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:40:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-19 12:40:26,385 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:26,386 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:26,386 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1919546667, now seen corresponding path program 1 times [2018-09-19 12:40:26,387 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:26,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-09-19 12:40:26,387 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:26,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:26,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:26,432 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:31,632 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:31,633 INFO L272 AbstractInterpreter]: Visited 97 different actions 568 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:31,638 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:33,430 INFO L232 lantSequenceWeakener]: Weakened 279 states. On average, predicates are now at 72.92% of their original sizes. [2018-09-19 12:40:33,430 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:33,587 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:33,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:33,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:33,587 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:33,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:33,588 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:33,588 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:33,588 INFO L87 Difference]: Start difference. First operand 15014 states and 19527 transitions. Second operand 10 states. [2018-09-19 12:40:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:38,008 INFO L93 Difference]: Finished difference Result 31248 states and 40901 transitions. [2018-09-19 12:40:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:38,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 282 [2018-09-19 12:40:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:38,039 INFO L225 Difference]: With dead ends: 31248 [2018-09-19 12:40:38,039 INFO L226 Difference]: Without dead ends: 16384 [2018-09-19 12:40:38,059 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2018-09-19 12:40:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16100. [2018-09-19 12:40:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2018-09-19 12:40:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 21070 transitions. [2018-09-19 12:40:38,310 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 21070 transitions. Word has length 282 [2018-09-19 12:40:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:38,310 INFO L480 AbstractCegarLoop]: Abstraction has 16100 states and 21070 transitions. [2018-09-19 12:40:38,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 21070 transitions. [2018-09-19 12:40:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-19 12:40:38,323 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:38,324 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:38,324 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1091601437, now seen corresponding path program 1 times [2018-09-19 12:40:38,324 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:38,324 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-09-19 12:40:38,325 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:38,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:38,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:38,370 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:44,421 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:44,421 INFO L272 AbstractInterpreter]: Visited 97 different actions 664 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:44,430 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:46,262 INFO L232 lantSequenceWeakener]: Weakened 283 states. On average, predicates are now at 72.92% of their original sizes. [2018-09-19 12:40:46,263 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:46,351 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:46,352 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:46,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:46,352 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:46,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:46,352 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:46,352 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:46,353 INFO L87 Difference]: Start difference. First operand 16100 states and 21070 transitions. Second operand 10 states. [2018-09-19 12:40:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:49,278 INFO L93 Difference]: Finished difference Result 33283 states and 43657 transitions. [2018-09-19 12:40:49,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:49,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2018-09-19 12:40:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:49,305 INFO L225 Difference]: With dead ends: 33283 [2018-09-19 12:40:49,305 INFO L226 Difference]: Without dead ends: 17333 [2018-09-19 12:40:49,323 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 293 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-09-19 12:40:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17020. [2018-09-19 12:40:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-09-19 12:40:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 22326 transitions. [2018-09-19 12:40:49,734 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 22326 transitions. Word has length 286 [2018-09-19 12:40:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:49,734 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 22326 transitions. [2018-09-19 12:40:49,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 22326 transitions. [2018-09-19 12:40:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-19 12:40:49,749 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:49,749 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-19 12:40:49,750 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -438135541, now seen corresponding path program 1 times [2018-09-19 12:40:49,750 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:49,750 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-09-19 12:40:49,751 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:49,753 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:49,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:49,829 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:50,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:50,097 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:40:50,105 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:50,350 INFO L232 lantSequenceWeakener]: Weakened 286 states. On average, predicates are now at 72.88% of their original sizes. [2018-09-19 12:40:50,350 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:50,439 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:50,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:50,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:50,440 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:50,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:50,440 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:50,440 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:50,440 INFO L87 Difference]: Start difference. First operand 17020 states and 22326 transitions. Second operand 10 states. [2018-09-19 12:40:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:53,927 INFO L93 Difference]: Finished difference Result 35215 states and 46290 transitions. [2018-09-19 12:40:53,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:53,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2018-09-19 12:40:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:53,953 INFO L225 Difference]: With dead ends: 35215 [2018-09-19 12:40:53,954 INFO L226 Difference]: Without dead ends: 18345 [2018-09-19 12:40:53,970 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2018-09-19 12:40:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17954. [2018-09-19 12:40:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2018-09-19 12:40:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 23579 transitions. [2018-09-19 12:40:54,243 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 23579 transitions. Word has length 289 [2018-09-19 12:40:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:54,243 INFO L480 AbstractCegarLoop]: Abstraction has 17954 states and 23579 transitions. [2018-09-19 12:40:54,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 23579 transitions. [2018-09-19 12:40:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-19 12:40:54,258 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:54,258 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 12:40:54,258 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1004931093, now seen corresponding path program 1 times [2018-09-19 12:40:54,259 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:54,259 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-09-19 12:40:54,259 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:54,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:54,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:54,300 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:54,553 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:54,553 INFO L272 AbstractInterpreter]: Visited 119 different actions 704 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:54,564 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:54,792 INFO L232 lantSequenceWeakener]: Weakened 291 states. On average, predicates are now at 72.91% of their original sizes. [2018-09-19 12:40:54,792 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:54,882 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:54,883 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:54,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:54,883 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:54,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:54,884 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:54,884 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:54,884 INFO L87 Difference]: Start difference. First operand 17954 states and 23579 transitions. Second operand 10 states. [2018-09-19 12:40:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:57,797 INFO L93 Difference]: Finished difference Result 37767 states and 49724 transitions. [2018-09-19 12:40:57,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:57,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 294 [2018-09-19 12:40:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:57,836 INFO L225 Difference]: With dead ends: 37767 [2018-09-19 12:40:57,836 INFO L226 Difference]: Without dead ends: 19963 [2018-09-19 12:40:57,854 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2018-09-19 12:40:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19520. [2018-09-19 12:40:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2018-09-19 12:40:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 25686 transitions. [2018-09-19 12:40:58,136 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 25686 transitions. Word has length 294 [2018-09-19 12:40:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:58,136 INFO L480 AbstractCegarLoop]: Abstraction has 19520 states and 25686 transitions. [2018-09-19 12:40:58,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 25686 transitions. [2018-09-19 12:40:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-19 12:40:58,151 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:58,151 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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] [2018-09-19 12:40:58,151 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash -665388655, now seen corresponding path program 1 times [2018-09-19 12:40:58,152 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:58,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-09-19 12:40:58,152 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:58,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:58,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:58,193 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:58,741 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:58,742 INFO L272 AbstractInterpreter]: Visited 119 different actions 819 times. Merged at 8 different actions 52 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:58,747 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:58,993 INFO L232 lantSequenceWeakener]: Weakened 305 states. On average, predicates are now at 72.9% of their original sizes. [2018-09-19 12:40:58,993 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:59,171 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:59,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:59,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:59,171 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:59,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:59,172 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:59,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:59,173 INFO L87 Difference]: Start difference. First operand 19520 states and 25686 transitions. Second operand 10 states. [2018-09-19 12:41:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:04,302 INFO L93 Difference]: Finished difference Result 40792 states and 53797 transitions. [2018-09-19 12:41:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:04,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 308 [2018-09-19 12:41:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:04,338 INFO L225 Difference]: With dead ends: 40792 [2018-09-19 12:41:04,338 INFO L226 Difference]: Without dead ends: 21422 [2018-09-19 12:41:04,357 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 315 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2018-09-19 12:41:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 21074. [2018-09-19 12:41:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2018-09-19 12:41:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 27733 transitions. [2018-09-19 12:41:04,640 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 27733 transitions. Word has length 308 [2018-09-19 12:41:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:04,640 INFO L480 AbstractCegarLoop]: Abstraction has 21074 states and 27733 transitions. [2018-09-19 12:41:04,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 27733 transitions. [2018-09-19 12:41:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-09-19 12:41:04,650 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:04,651 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 12:41:04,651 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 546683230, now seen corresponding path program 1 times [2018-09-19 12:41:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:04,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-09-19 12:41:04,652 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:04,654 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:04,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:04,691 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:04,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:41:04,978 INFO L272 AbstractInterpreter]: Visited 130 different actions 636 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:04,998 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:41:05,041 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:41:05,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:41:05 BoogieIcfgContainer [2018-09-19 12:41:05,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:41:05,042 INFO L168 Benchmark]: Toolchain (without parser) took 125255.12 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-19 12:41:05,044 INFO L168 Benchmark]: CDTParser took 0.19 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-09-19 12:41:05,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:05,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:05,046 INFO L168 Benchmark]: Boogie Preprocessor took 278.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -855.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:05,047 INFO L168 Benchmark]: RCFGBuilder took 3398.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 124.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:05,048 INFO L168 Benchmark]: TraceAbstraction took 120758.50 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -505.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-19 12:41:05,052 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.19 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 706.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 104.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 278.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -855.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3398.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 124.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120758.50 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -505.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 76]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L76] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 120.6s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 72.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3940 SDtfs, 18749 SDslu, 6849 SDs, 0 SdLazy, 41596 SolverSat, 4927 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 57.9s Time, PredicateUnifierStatistics: 46 DeclaredPredicates, 5100 GetRequests, 4747 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21074occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 28.1s AbstIntTime, 24 AbstIntIterations, 23 AbstIntStrong, 0.9964491762300594 AbsIntWeakeningRatio, 0.12380759082606048 AbsIntAvgWeakeningVarsNumRemoved, 21.3661457276233 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 3250 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label06_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-41-05-067.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label06_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-41-05-067.csv Received shutdown request...