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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 09:58:43,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 09:58:43,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 09:58:43,233 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 09:58:43,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 09:58:43,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 09:58:43,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 09:58:43,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 09:58:43,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 09:58:43,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 09:58:43,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 09:58:43,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 09:58:43,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 09:58:43,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 09:58:43,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 09:58:43,246 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 09:58:43,247 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 09:58:43,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 09:58:43,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 09:58:43,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 09:58:43,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 09:58:43,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 09:58:43,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 09:58:43,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 09:58:43,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 09:58:43,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 09:58:43,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 09:58:43,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 09:58:43,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 09:58:43,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 09:58:43,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 09:58:43,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 09:58:43,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 09:58:43,268 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 09:58:43,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 09:58:43,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 09:58:43,270 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-19 09:58:43,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 09:58:43,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 09:58:43,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 09:58:43,297 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 09:58:43,297 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 09:58:43,300 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 09:58:43,300 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 09:58:43,300 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 09:58:43,300 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 09:58:43,300 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 09:58:43,301 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 09:58:43,301 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 09:58:43,301 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 09:58:43,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 09:58:43,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 09:58:43,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 09:58:43,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 09:58:43,303 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 09:58:43,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 09:58:43,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 09:58:43,304 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 09:58:43,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 09:58:43,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 09:58:43,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 09:58:43,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 09:58:43,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 09:58:43,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 09:58:43,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 09:58:43,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 09:58:43,306 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 09:58:43,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 09:58:43,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 09:58:43,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 09:58:43,307 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 09:58:43,307 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 09:58:43,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 09:58:43,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 09:58:43,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 09:58:43,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 09:58:43,400 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 09:58:43,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label19_true-unreach-call.c [2018-09-19 09:58:43,771 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453ee2a30/a1adf04ac08e4c38ab53c3a6dc031031/FLAG15e498872 [2018-09-19 09:58:43,998 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 09:58:43,999 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label19_true-unreach-call.c [2018-09-19 09:58:44,014 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453ee2a30/a1adf04ac08e4c38ab53c3a6dc031031/FLAG15e498872 [2018-09-19 09:58:44,032 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453ee2a30/a1adf04ac08e4c38ab53c3a6dc031031 [2018-09-19 09:58:44,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 09:58:44,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 09:58:44,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 09:58:44,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 09:58:44,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 09:58:44,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1683e0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44, skipping insertion in model container [2018-09-19 09:58:44,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,078 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 09:58:44,580 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 09:58:44,616 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 09:58:44,791 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 09:58:44,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44 WrapperNode [2018-09-19 09:58:44,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 09:58:44,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 09:58:44,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 09:58:44,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 09:58:44,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 09:58:44,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 09:58:44,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 09:58:44,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 09:58:44,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:44,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:45,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:45,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:45,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (1/1) ... [2018-09-19 09:58:45,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 09:58:45,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 09:58:45,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 09:58:45,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 09:58:45,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (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 09:58:45,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 09:58:45,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 09:58:45,327 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 09:58:45,328 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 09:58:45,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 09:58:45,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 09:58:45,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 09:58:45,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 09:58:48,740 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 09:58:48,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 09:58:48 BoogieIcfgContainer [2018-09-19 09:58:48,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 09:58:48,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 09:58:48,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 09:58:48,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 09:58:48,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 09:58:44" (1/3) ... [2018-09-19 09:58:48,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651b973a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 09:58:48, skipping insertion in model container [2018-09-19 09:58:48,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:58:44" (2/3) ... [2018-09-19 09:58:48,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651b973a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 09:58:48, skipping insertion in model container [2018-09-19 09:58:48,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 09:58:48" (3/3) ... [2018-09-19 09:58:48,751 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label19_true-unreach-call.c [2018-09-19 09:58:48,759 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 09:58:48,768 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 09:58:48,820 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 09:58:48,821 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 09:58:48,822 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 09:58:48,822 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 09:58:48,822 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 09:58:48,822 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 09:58:48,822 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 09:58:48,823 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 09:58:48,823 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 09:58:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 09:58:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-19 09:58:48,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:58:48,865 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, 1, 1, 1, 1, 1] [2018-09-19 09:58:48,866 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:58:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash -354571332, now seen corresponding path program 1 times [2018-09-19 09:58:48,875 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:58:48,876 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-09-19 09:58:48,879 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 09:58:48,942 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:58:48,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:58:50,005 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:58:50,007 INFO L272 AbstractInterpreter]: Visited 35 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 09:58:50,023 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:58:50,563 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 74.96% of their original sizes. [2018-09-19 09:58:50,563 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:58:50,901 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:58:50,903 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:58:50,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 09:58:50,903 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:58:50,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 09:58:50,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 09:58:50,919 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 09:58:50,923 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 09:58:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:58:55,052 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 09:58:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 09:58:55,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-09-19 09:58:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:58:55,079 INFO L225 Difference]: With dead ends: 576 [2018-09-19 09:58:55,079 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 09:58:55,093 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 09:58:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 09:58:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 09:58:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 09:58:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 09:58:55,193 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 36 [2018-09-19 09:58:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:58:55,194 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 09:58:55,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 09:58:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 09:58:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-19 09:58:55,206 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:58:55,207 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:58:55,207 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:58:55,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1921560907, now seen corresponding path program 1 times [2018-09-19 09:58:55,208 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:58:55,209 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2018-09-19 09:58:55,210 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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 09:58:55,225 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:58:55,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:58:56,718 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:58:59,751 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:58:59,751 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 09:58:59,759 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:00,510 INFO L232 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 09:59:00,510 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:01,188 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:01,189 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:01,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 09:59:01,189 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:01,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 09:59:01,191 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 09:59:01,191 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 09:59:01,191 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 09:59:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:06,890 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 09:59:06,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 09:59:06,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2018-09-19 09:59:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:06,900 INFO L225 Difference]: With dead ends: 717 [2018-09-19 09:59:06,900 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 09:59:06,902 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 09:59:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 09:59:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 09:59:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 09:59:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 09:59:06,939 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 107 [2018-09-19 09:59:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:06,940 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 09:59:06,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 09:59:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 09:59:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-19 09:59:06,943 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:06,944 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, 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] [2018-09-19 09:59:06,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash 321086224, now seen corresponding path program 1 times [2018-09-19 09:59:06,945 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:06,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2018-09-19 09:59:06,945 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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 09:59:06,950 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:06,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:10,900 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:59:12,743 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:59:12,744 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 09:59:12,784 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:13,502 INFO L232 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 73.48% of their original sizes. [2018-09-19 09:59:13,502 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:14,357 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:14,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:14,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 09:59:14,358 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:14,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 09:59:14,359 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 09:59:14,359 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 09:59:14,360 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 13 states. [2018-09-19 09:59:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:26,606 INFO L93 Difference]: Finished difference Result 1333 states and 2096 transitions. [2018-09-19 09:59:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 09:59:26,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-09-19 09:59:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:26,616 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 09:59:26,616 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 09:59:26,619 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 09:59:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 09:59:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 09:59:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 09:59:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-09-19 09:59:26,662 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 116 [2018-09-19 09:59:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:26,663 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-09-19 09:59:26,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 09:59:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-09-19 09:59:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-19 09:59:26,668 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:26,668 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, 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] [2018-09-19 09:59:26,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 495453064, now seen corresponding path program 1 times [2018-09-19 09:59:26,669 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:26,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-09-19 09:59:26,670 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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 09:59:26,676 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:26,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:29,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:59:35,827 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:59:35,827 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 09:59:35,832 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:36,551 INFO L232 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 09:59:36,551 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:37,011 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:37,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:37,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 09:59:37,012 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:37,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 09:59:37,013 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 09:59:37,013 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 09:59:37,014 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 12 states. [2018-09-19 09:59:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:42,980 INFO L93 Difference]: Finished difference Result 1677 states and 2220 transitions. [2018-09-19 09:59:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 09:59:42,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 152 [2018-09-19 09:59:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:42,988 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 09:59:42,988 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 09:59:42,996 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 09:59:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 09:59:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 09:59:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 09:59:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1287 transitions. [2018-09-19 09:59:43,051 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1287 transitions. Word has length 152 [2018-09-19 09:59:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:43,053 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1287 transitions. [2018-09-19 09:59:43,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 09:59:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1287 transitions. [2018-09-19 09:59:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-19 09:59:43,058 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:43,059 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:59:43,059 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash 59741387, now seen corresponding path program 1 times [2018-09-19 09:59:43,060 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:43,061 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-09-19 09:59:43,061 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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 09:59:43,075 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:43,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:52,991 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:59:52,992 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 09:59:52,999 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:53,802 INFO L232 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 09:59:53,803 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:54,170 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:54,170 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:54,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 09:59:54,170 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:54,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 09:59:54,171 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 09:59:54,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 09:59:54,172 INFO L87 Difference]: Start difference. First operand 1056 states and 1287 transitions. Second operand 12 states. [2018-09-19 09:59:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:58,598 INFO L93 Difference]: Finished difference Result 2268 states and 2899 transitions. [2018-09-19 09:59:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 09:59:58,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 171 [2018-09-19 09:59:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:58,608 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 09:59:58,608 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 09:59:58,611 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 180 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 09:59:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 09:59:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 09:59:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 09:59:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1615 transitions. [2018-09-19 09:59:58,659 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1615 transitions. Word has length 171 [2018-09-19 09:59:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:58,660 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1615 transitions. [2018-09-19 09:59:58,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 09:59:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1615 transitions. [2018-09-19 09:59:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-19 09:59:58,663 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:58,664 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:59:58,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1396025191, now seen corresponding path program 1 times [2018-09-19 09:59:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:58,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-19 09:59:58,665 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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 09:59:58,668 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:58,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:59,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:00:04,632 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:00:04,633 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 10:00:04,639 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:00:05,427 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 10:00:05,428 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:00:06,292 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:00:06,293 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:00:06,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:00:06,293 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:00:06,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:00:06,294 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:00:06,294 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:00:06,295 INFO L87 Difference]: Start difference. First operand 1352 states and 1615 transitions. Second operand 10 states. [2018-09-19 10:00:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:00:11,251 INFO L93 Difference]: Finished difference Result 2719 states and 3388 transitions. [2018-09-19 10:00:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:00:11,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2018-09-19 10:00:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:00:11,272 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 10:00:11,273 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 10:00:11,278 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 174 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 10:00:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 10:00:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 10:00:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 10:00:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1792 transitions. [2018-09-19 10:00:11,356 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1792 transitions. Word has length 183 [2018-09-19 10:00:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:00:11,356 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1792 transitions. [2018-09-19 10:00:11,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:00:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2018-09-19 10:00:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-19 10:00:11,361 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:00:11,361 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:00:11,361 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:00:11,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1227979011, now seen corresponding path program 1 times [2018-09-19 10:00:11,362 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:00:11,362 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-09-19 10:00:11,362 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:00:11,368 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:00:11,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:00:12,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:00:18,082 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:00:18,083 INFO L272 AbstractInterpreter]: Visited 86 different actions 333 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:00:18,113 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:00:19,016 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 10:00:19,016 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:00:19,285 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:00:19,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:00:19,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:00:19,286 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:00:19,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:00:19,286 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:00:19,286 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:00:19,287 INFO L87 Difference]: Start difference. First operand 1503 states and 1792 transitions. Second operand 10 states. [2018-09-19 10:00:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:00:25,096 INFO L93 Difference]: Finished difference Result 3020 states and 3751 transitions. [2018-09-19 10:00:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:00:25,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2018-09-19 10:00:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:00:25,111 INFO L225 Difference]: With dead ends: 3020 [2018-09-19 10:00:25,112 INFO L226 Difference]: Without dead ends: 1671 [2018-09-19 10:00:25,115 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 176 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 10:00:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-19 10:00:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1654. [2018-09-19 10:00:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-09-19 10:00:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1988 transitions. [2018-09-19 10:00:25,174 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1988 transitions. Word has length 185 [2018-09-19 10:00:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:00:25,174 INFO L480 AbstractCegarLoop]: Abstraction has 1654 states and 1988 transitions. [2018-09-19 10:00:25,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:00:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1988 transitions. [2018-09-19 10:00:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-19 10:00:25,178 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:00:25,178 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:00:25,178 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:00:25,179 INFO L82 PathProgramCache]: Analyzing trace with hash 948016187, now seen corresponding path program 1 times [2018-09-19 10:00:25,179 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:00:25,179 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-09-19 10:00:25,179 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:00:25,182 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:00:25,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:00:26,591 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:00:32,087 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:00:32,088 INFO L272 AbstractInterpreter]: Visited 90 different actions 349 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:00:32,093 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:00:32,899 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 10:00:32,899 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:00:33,186 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:00:33,186 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:00:33,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:00:33,187 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:00:33,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:00:33,188 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:00:33,188 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:00:33,188 INFO L87 Difference]: Start difference. First operand 1654 states and 1988 transitions. Second operand 10 states. [2018-09-19 10:00:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:00:38,322 INFO L93 Difference]: Finished difference Result 3477 states and 4328 transitions. [2018-09-19 10:00:38,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:00:38,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-09-19 10:00:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:00:38,332 INFO L225 Difference]: With dead ends: 3477 [2018-09-19 10:00:38,332 INFO L226 Difference]: Without dead ends: 1977 [2018-09-19 10:00:38,337 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 180 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 10:00:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-09-19 10:00:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1954. [2018-09-19 10:00:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-09-19 10:00:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2362 transitions. [2018-09-19 10:00:38,411 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2362 transitions. Word has length 189 [2018-09-19 10:00:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:00:38,412 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2362 transitions. [2018-09-19 10:00:38,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:00:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2362 transitions. [2018-09-19 10:00:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 10:00:38,415 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:00:38,416 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, 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, 1, 1, 1, 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 10:00:38,416 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:00:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash -610211569, now seen corresponding path program 1 times [2018-09-19 10:00:38,417 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:00:38,417 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 10:00:38,417 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:00:38,420 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:00:38,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:00:39,844 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:00:49,071 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:00:49,072 INFO L272 AbstractInterpreter]: Visited 96 different actions 373 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:00:49,077 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:00:49,900 INFO L232 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 10:00:49,900 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:00:50,173 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:00:50,174 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:00:50,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:00:50,174 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:00:50,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:00:50,175 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:00:50,175 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:00:50,175 INFO L87 Difference]: Start difference. First operand 1954 states and 2362 transitions. Second operand 10 states. [2018-09-19 10:00:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:00:55,168 INFO L93 Difference]: Finished difference Result 3932 states and 4909 transitions. [2018-09-19 10:00:55,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:00:55,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 10:00:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:00:55,180 INFO L225 Difference]: With dead ends: 3932 [2018-09-19 10:00:55,180 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 10:00:55,185 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 186 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 10:00:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 10:00:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2018-09-19 10:00:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-09-19 10:00:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2577 transitions. [2018-09-19 10:00:55,261 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2577 transitions. Word has length 195 [2018-09-19 10:00:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:00:55,261 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 2577 transitions. [2018-09-19 10:00:55,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:00:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2577 transitions. [2018-09-19 10:00:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-19 10:00:55,266 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:00:55,266 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:55,266 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:00:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1886739960, now seen corresponding path program 1 times [2018-09-19 10:00:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:00:55,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-09-19 10:00:55,267 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:00:55,270 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:00:55,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:00:56,490 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:01:06,462 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:06,463 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 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 10:01:06,470 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:01:07,352 INFO L232 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-19 10:01:07,352 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:01:07,686 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:01:07,687 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:01:07,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:01:07,687 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:01:07,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:01:07,688 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:01:07,688 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:01:07,688 INFO L87 Difference]: Start difference. First operand 2109 states and 2577 transitions. Second operand 11 states. [2018-09-19 10:01:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:01:13,397 INFO L93 Difference]: Finished difference Result 4320 states and 5463 transitions. [2018-09-19 10:01:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:01:13,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2018-09-19 10:01:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:01:13,407 INFO L225 Difference]: With dead ends: 4320 [2018-09-19 10:01:13,407 INFO L226 Difference]: Without dead ends: 2365 [2018-09-19 10:01:13,413 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:01:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-09-19 10:01:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2262. [2018-09-19 10:01:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-19 10:01:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2792 transitions. [2018-09-19 10:01:13,493 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2792 transitions. Word has length 204 [2018-09-19 10:01:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:01:13,494 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 2792 transitions. [2018-09-19 10:01:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:01:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2792 transitions. [2018-09-19 10:01:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 10:01:13,498 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:01:13,499 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:13,499 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:01:13,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1229324956, now seen corresponding path program 1 times [2018-09-19 10:01:13,499 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:01:13,500 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 10:01:13,500 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [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], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:01:13,503 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:01:13,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:01:15,006 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:01:22,877 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:22,877 INFO L272 AbstractInterpreter]: Visited 111 different actions 433 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:01:22,884 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:01:23,759 INFO L232 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 10:01:23,760 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:01:24,156 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:01:24,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:01:24,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:01:24,157 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:01:24,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:01:24,158 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:01:24,158 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:01:24,158 INFO L87 Difference]: Start difference. First operand 2262 states and 2792 transitions. Second operand 11 states. [2018-09-19 10:01:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:01:32,215 INFO L93 Difference]: Finished difference Result 4808 states and 6139 transitions. [2018-09-19 10:01:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:01:32,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2018-09-19 10:01:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:01:32,228 INFO L225 Difference]: With dead ends: 4808 [2018-09-19 10:01:32,229 INFO L226 Difference]: Without dead ends: 2700 [2018-09-19 10:01:32,235 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:01:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-09-19 10:01:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2670. [2018-09-19 10:01:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-19 10:01:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3328 transitions. [2018-09-19 10:01:32,330 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3328 transitions. Word has length 210 [2018-09-19 10:01:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:01:32,333 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 3328 transitions. [2018-09-19 10:01:32,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:01:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3328 transitions. [2018-09-19 10:01:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-19 10:01:32,337 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:01:32,338 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:32,338 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:01:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1696846531, now seen corresponding path program 1 times [2018-09-19 10:01:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:01:32,339 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-19 10:01:32,339 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [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], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:01:32,342 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:01:32,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:01:33,721 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:01:42,538 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:42,538 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 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 10:01:42,546 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:01:43,373 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.17% of their original sizes. [2018-09-19 10:01:43,374 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:01:43,702 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:01:43,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:01:43,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:01:43,702 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:01:43,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:01:43,703 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:01:43,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:01:43,704 INFO L87 Difference]: Start difference. First operand 2670 states and 3328 transitions. Second operand 11 states. [2018-09-19 10:01:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:01:49,071 INFO L93 Difference]: Finished difference Result 5752 states and 7377 transitions. [2018-09-19 10:01:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:01:49,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 217 [2018-09-19 10:01:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:01:49,089 INFO L225 Difference]: With dead ends: 5752 [2018-09-19 10:01:49,090 INFO L226 Difference]: Without dead ends: 3236 [2018-09-19 10:01:49,096 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:01:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-09-19 10:01:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3129. [2018-09-19 10:01:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2018-09-19 10:01:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 3930 transitions. [2018-09-19 10:01:49,216 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 3930 transitions. Word has length 217 [2018-09-19 10:01:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:01:49,216 INFO L480 AbstractCegarLoop]: Abstraction has 3129 states and 3930 transitions. [2018-09-19 10:01:49,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:01:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3930 transitions. [2018-09-19 10:01:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 10:01:49,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:01:49,222 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:49,222 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:01:49,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1180817640, now seen corresponding path program 1 times [2018-09-19 10:01:49,223 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:01:49,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 10:01:49,225 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [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], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:01:49,230 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:01:49,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:01:50,700 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:01:59,853 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:59,853 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 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 10:01:59,862 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:00,708 INFO L232 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 73.16% of their original sizes. [2018-09-19 10:02:00,708 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:01,158 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:01,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:01,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:02:01,159 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:01,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:02:01,160 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:02:01,160 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:02:01,160 INFO L87 Difference]: Start difference. First operand 3129 states and 3930 transitions. Second operand 13 states. [2018-09-19 10:02:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:10,530 INFO L93 Difference]: Finished difference Result 6701 states and 8709 transitions. [2018-09-19 10:02:10,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:02:10,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 220 [2018-09-19 10:02:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:10,552 INFO L225 Difference]: With dead ends: 6701 [2018-09-19 10:02:10,552 INFO L226 Difference]: Without dead ends: 3726 [2018-09-19 10:02:10,560 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 10:02:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2018-09-19 10:02:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3529. [2018-09-19 10:02:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-09-19 10:02:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4443 transitions. [2018-09-19 10:02:10,685 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4443 transitions. Word has length 220 [2018-09-19 10:02:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:10,686 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4443 transitions. [2018-09-19 10:02:10,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:02:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4443 transitions. [2018-09-19 10:02:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-19 10:02:10,691 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:10,692 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:10,692 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash 63265307, now seen corresponding path program 1 times [2018-09-19 10:02:10,692 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:10,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-09-19 10:02:10,693 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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 10:02:10,696 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:10,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:13,287 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:02:24,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:24,308 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:02:24,315 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:25,311 INFO L232 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 73.15% of their original sizes. [2018-09-19 10:02:25,312 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:25,590 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:25,590 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:25,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:02:25,590 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:25,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:02:25,591 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:02:25,591 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:02:25,592 INFO L87 Difference]: Start difference. First operand 3529 states and 4443 transitions. Second operand 10 states. [2018-09-19 10:02:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:33,396 INFO L93 Difference]: Finished difference Result 7079 states and 9092 transitions. [2018-09-19 10:02:33,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:02:33,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2018-09-19 10:02:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:33,412 INFO L225 Difference]: With dead ends: 7079 [2018-09-19 10:02:33,413 INFO L226 Difference]: Without dead ends: 3704 [2018-09-19 10:02:33,421 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 216 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 10:02:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2018-09-19 10:02:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3677. [2018-09-19 10:02:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-09-19 10:02:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4642 transitions. [2018-09-19 10:02:33,557 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4642 transitions. Word has length 225 [2018-09-19 10:02:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:33,557 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 4642 transitions. [2018-09-19 10:02:33,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:02:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4642 transitions. [2018-09-19 10:02:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-19 10:02:33,564 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:33,564 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:33,564 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1701643371, now seen corresponding path program 1 times [2018-09-19 10:02:33,565 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:33,565 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-09-19 10:02:33,566 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [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], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:33,569 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:33,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:35,002 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:02:48,425 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:48,426 INFO L272 AbstractInterpreter]: Visited 130 different actions 634 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 10:02:48,433 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:49,384 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.14% of their original sizes. [2018-09-19 10:02:49,384 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:49,863 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:49,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:49,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:02:49,864 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:49,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:02:49,865 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:02:49,865 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:02:49,865 INFO L87 Difference]: Start difference. First operand 3677 states and 4642 transitions. Second operand 13 states. [2018-09-19 10:02:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:57,558 INFO L93 Difference]: Finished difference Result 7711 states and 9961 transitions. [2018-09-19 10:02:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 10:02:57,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 229 [2018-09-19 10:02:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:57,584 INFO L225 Difference]: With dead ends: 7711 [2018-09-19 10:02:57,585 INFO L226 Difference]: Without dead ends: 4188 [2018-09-19 10:02:57,595 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-09-19 10:02:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2018-09-19 10:02:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3996. [2018-09-19 10:02:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3996 states. [2018-09-19 10:02:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 5095 transitions. [2018-09-19 10:02:57,728 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 5095 transitions. Word has length 229 [2018-09-19 10:02:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:57,729 INFO L480 AbstractCegarLoop]: Abstraction has 3996 states and 5095 transitions. [2018-09-19 10:02:57,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:02:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 5095 transitions. [2018-09-19 10:02:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-19 10:02:57,739 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:57,739 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:57,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:57,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1198920904, now seen corresponding path program 1 times [2018-09-19 10:02:57,740 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:57,740 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-09-19 10:02:57,740 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [189], [191], [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], [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], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:57,745 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:57,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:59,310 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 10:03:03,474 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 10:03:03,475 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 10:03:03,476 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:03:03,518 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:03:03,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:03:03 BoogieIcfgContainer [2018-09-19 10:03:03,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:03:03,520 INFO L168 Benchmark]: Toolchain (without parser) took 259473.62 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.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:03:03,524 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 10:03:03,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.35 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 10:03:03,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 10:03:03,525 INFO L168 Benchmark]: Boogie Preprocessor took 282.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 741.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -832.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2018-09-19 10:03:03,526 INFO L168 Benchmark]: RCFGBuilder took 3492.58 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 97.3 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. [2018-09-19 10:03:03,527 INFO L168 Benchmark]: TraceAbstraction took 254776.23 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -614.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:03:03,533 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.35 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 128.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 282.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 741.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -832.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3492.58 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 97.3 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254776.23 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -614.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 91]: 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 TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [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 FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND TRUE ((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))) [L535] a1 = (((a1 + -438195) * 1) * 1) [L536] a10 = 2 [L537] a19 = 8 [L539] 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 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 TRUE (((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)) [L91] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 254.7s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 97.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2891 SDtfs, 12790 SDslu, 4071 SDs, 0 SdLazy, 24804 SolverSat, 2778 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.8s Time, PredicateUnifierStatistics: 30 DeclaredPredicates, 2756 GetRequests, 2492 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3996occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 136.6s AbstIntTime, 16 AbstIntIterations, 15 AbstIntStrong, 0.9938395503952583 AbsIntWeakeningRatio, 0.13490853658536586 AbsIntAvgWeakeningVarsNumRemoved, 874.5438262195122 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 984 StatesRemovedByMinimization, 15 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_label19_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-03-03-561.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label19_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-03-03-561.csv Completed graceful shutdown