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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 11:29:45,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 11:29:45,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 11:29:45,499 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 11:29:45,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 11:29:45,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 11:29:45,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 11:29:45,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 11:29:45,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 11:29:45,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 11:29:45,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 11:29:45,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 11:29:45,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 11:29:45,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 11:29:45,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 11:29:45,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 11:29:45,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 11:29:45,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 11:29:45,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 11:29:45,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 11:29:45,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 11:29:45,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 11:29:45,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 11:29:45,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 11:29:45,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 11:29:45,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 11:29:45,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 11:29:45,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 11:29:45,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 11:29:45,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 11:29:45,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 11:29:45,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 11:29:45,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 11:29:45,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 11:29:45,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 11:29:45,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 11:29:45,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 11:29:45,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 11:29:45,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 11:29:45,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 11:29:45,571 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 11:29:45,571 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 11:29:45,572 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 11:29:45,572 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 11:29:45,572 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 11:29:45,572 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 11:29:45,572 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 11:29:45,572 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 11:29:45,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 11:29:45,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 11:29:45,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 11:29:45,574 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 11:29:45,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 11:29:45,574 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 11:29:45,574 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 11:29:45,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 11:29:45,575 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 11:29:45,575 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 11:29:45,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 11:29:45,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 11:29:45,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:29:45,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 11:29:45,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 11:29:45,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 11:29:45,576 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 11:29:45,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 11:29:45,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 11:29:45,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 11:29:45,577 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 11:29:45,577 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 11:29:45,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 11:29:45,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 11:29:45,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 11:29:45,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 11:29:45,658 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 11:29:45,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-09-15 11:29:46,060 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7428fe6/2c207a3bdaae4b059f4f3bf2718fd46b/FLAG412d09f83 [2018-09-15 11:29:46,342 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 11:29:46,344 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-09-15 11:29:46,370 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7428fe6/2c207a3bdaae4b059f4f3bf2718fd46b/FLAG412d09f83 [2018-09-15 11:29:46,397 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7428fe6/2c207a3bdaae4b059f4f3bf2718fd46b [2018-09-15 11:29:46,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 11:29:46,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 11:29:46,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 11:29:46,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 11:29:46,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 11:29:46,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:29:46" (1/1) ... [2018-09-15 11:29:46,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f15d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:46, skipping insertion in model container [2018-09-15 11:29:46,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:29:46" (1/1) ... [2018-09-15 11:29:46,441 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 11:29:46,930 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:29:46,955 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 11:29:47,132 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:29:47,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47 WrapperNode [2018-09-15 11:29:47,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 11:29:47,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 11:29:47,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 11:29:47,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 11:29:47,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 11:29:47,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 11:29:47,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 11:29:47,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 11:29:47,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (1/1) ... [2018-09-15 11:29:47,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 11:29:47,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 11:29:47,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 11:29:47,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 11:29:47,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (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-15 11:29:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 11:29:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 11:29:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 11:29:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 11:29:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 11:29:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 11:29:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 11:29:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 11:29:51,279 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 11:29:51,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:29:51 BoogieIcfgContainer [2018-09-15 11:29:51,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 11:29:51,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 11:29:51,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 11:29:51,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 11:29:51,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:29:46" (1/3) ... [2018-09-15 11:29:51,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a26098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:29:51, skipping insertion in model container [2018-09-15 11:29:51,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:29:47" (2/3) ... [2018-09-15 11:29:51,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a26098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:29:51, skipping insertion in model container [2018-09-15 11:29:51,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:29:51" (3/3) ... [2018-09-15 11:29:51,289 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59_true-unreach-call.c [2018-09-15 11:29:51,300 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 11:29:51,312 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 11:29:51,369 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 11:29:51,370 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 11:29:51,370 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 11:29:51,370 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 11:29:51,370 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 11:29:51,371 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 11:29:51,371 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 11:29:51,371 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 11:29:51,371 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 11:29:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 11:29:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-15 11:29:51,415 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:29:51,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:29:51,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:29:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1019321972, now seen corresponding path program 1 times [2018-09-15 11:29:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:29:51,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-09-15 11:29:51,432 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 11:29:51,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:29:51,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:29:53,894 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:29:53,897 INFO L272 AbstractInterpreter]: Visited 71 different actions 71 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 11:29:53,921 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:29:54,833 INFO L232 lantSequenceWeakener]: Weakened 70 states. On average, predicates are now at 76.15% of their original sizes. [2018-09-15 11:29:54,834 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:29:55,176 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:29:55,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:29:55,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 11:29:55,183 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:29:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 11:29:55,200 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 11:29:55,201 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:29:55,204 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 11:30:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:30:00,205 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 11:30:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 11:30:00,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-09-15 11:30:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:30:00,227 INFO L225 Difference]: With dead ends: 576 [2018-09-15 11:30:00,227 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 11:30:00,235 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 67 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-15 11:30:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 11:30:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 11:30:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 11:30:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 11:30:00,323 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 72 [2018-09-15 11:30:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:30:00,324 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 11:30:00,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 11:30:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 11:30:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-15 11:30:00,333 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:30:00,333 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 11:30:00,334 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:30:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1630388773, now seen corresponding path program 1 times [2018-09-15 11:30:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:30:00,336 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-09-15 11:30:00,336 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:30:00,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:30:00,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:30:02,534 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:30:08,487 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:30:08,487 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:30:08,527 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:30:12,598 INFO L232 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 74.52% of their original sizes. [2018-09-15 11:30:12,598 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:30:15,326 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:30:15,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:30:15,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:30:15,327 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:30:15,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:30:15,329 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:30:15,329 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:30:15,330 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 11:30:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:30:22,339 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 11:30:22,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:30:22,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2018-09-15 11:30:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:30:22,347 INFO L225 Difference]: With dead ends: 711 [2018-09-15 11:30:22,348 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 11:30:22,351 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 60 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 11:30:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 11:30:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 11:30:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 11:30:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 11:30:22,397 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 143 [2018-09-15 11:30:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:30:22,399 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 11:30:22,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:30:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 11:30:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-15 11:30:22,404 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:30:22,405 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:30:22,405 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:30:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash -265136992, now seen corresponding path program 1 times [2018-09-15 11:30:22,406 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:30:22,406 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-09-15 11:30:22,406 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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-15 11:30:22,411 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:30:22,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:30:29,093 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:30:29,094 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:30:29,132 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:30:31,342 INFO L232 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 74.42% of their original sizes. [2018-09-15 11:30:31,343 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:30:32,803 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:30:32,804 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:30:32,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 11:30:32,805 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:30:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 11:30:32,806 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 11:30:32,807 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 11:30:32,807 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 11 states. [2018-09-15 11:30:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:30:40,556 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 11:30:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:30:40,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2018-09-15 11:30:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:30:40,565 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 11:30:40,565 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 11:30:40,567 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 82 SyntacticMatches, 60 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:30:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 11:30:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 11:30:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 11:30:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 11:30:40,625 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 152 [2018-09-15 11:30:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:30:40,626 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 11:30:40,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 11:30:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 11:30:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-15 11:30:40,632 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:30:40,632 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 11:30:40,633 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:30:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1534445288, now seen corresponding path program 1 times [2018-09-15 11:30:40,633 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:30:40,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-09-15 11:30:40,634 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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-15 11:30:40,640 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:30:40,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:30:44,028 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:30:55,072 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:30:55,072 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:30:55,098 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:30:59,527 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 74.09% of their original sizes. [2018-09-15 11:30:59,527 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:31:01,672 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:31:01,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:31:01,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 11:31:01,673 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:31:01,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 11:31:01,674 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 11:31:01,674 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-15 11:31:01,674 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 12 states. [2018-09-15 11:31:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:31:10,220 INFO L93 Difference]: Finished difference Result 1150 states and 1593 transitions. [2018-09-15 11:31:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 11:31:10,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2018-09-15 11:31:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:31:10,229 INFO L225 Difference]: With dead ends: 1150 [2018-09-15 11:31:10,229 INFO L226 Difference]: Without dead ends: 944 [2018-09-15 11:31:10,231 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 117 SyntacticMatches, 60 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-15 11:31:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-09-15 11:31:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 939. [2018-09-15 11:31:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-09-15 11:31:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1120 transitions. [2018-09-15 11:31:10,287 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1120 transitions. Word has length 188 [2018-09-15 11:31:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:31:10,288 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1120 transitions. [2018-09-15 11:31:10,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 11:31:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1120 transitions. [2018-09-15 11:31:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-15 11:31:10,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:31:10,293 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:31:10,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:31:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash -560242341, now seen corresponding path program 1 times [2018-09-15 11:31:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:31:10,295 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-15 11:31:10,295 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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-15 11:31:10,303 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:31:10,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:31:36,210 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:31:36,210 INFO L272 AbstractInterpreter]: Visited 142 different actions 549 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:31:36,220 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:31:38,293 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.96% of their original sizes. [2018-09-15 11:31:38,293 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:31:39,184 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:31:39,184 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:31:39,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 11:31:39,184 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:31:39,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 11:31:39,185 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 11:31:39,185 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-15 11:31:39,186 INFO L87 Difference]: Start difference. First operand 939 states and 1120 transitions. Second operand 15 states. [2018-09-15 11:31:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:31:45,804 INFO L93 Difference]: Finished difference Result 1301 states and 1760 transitions. [2018-09-15 11:31:45,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 11:31:45,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2018-09-15 11:31:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:31:45,813 INFO L225 Difference]: With dead ends: 1301 [2018-09-15 11:31:45,813 INFO L226 Difference]: Without dead ends: 1095 [2018-09-15 11:31:45,815 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:31:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-15 11:31:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1089. [2018-09-15 11:31:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-09-15 11:31:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1286 transitions. [2018-09-15 11:31:45,865 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1286 transitions. Word has length 207 [2018-09-15 11:31:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:31:45,866 INFO L480 AbstractCegarLoop]: Abstraction has 1089 states and 1286 transitions. [2018-09-15 11:31:45,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 11:31:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1286 transitions. [2018-09-15 11:31:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-15 11:31:45,870 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:31:45,871 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:31:45,871 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:31:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1633812980, now seen corresponding path program 1 times [2018-09-15 11:31:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:31:45,872 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-15 11:31:45,872 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:31:45,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:31:45,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:32:02,012 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:32:02,012 INFO L272 AbstractInterpreter]: Visited 145 different actions 284 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:32:02,022 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:32:06,012 INFO L232 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 73.94% of their original sizes. [2018-09-15 11:32:06,012 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:32:08,276 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:32:08,276 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:32:08,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 11:32:08,277 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:32:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 11:32:08,278 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 11:32:08,278 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 11:32:08,279 INFO L87 Difference]: Start difference. First operand 1089 states and 1286 transitions. Second operand 14 states. [2018-09-15 11:32:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:32:16,970 INFO L93 Difference]: Finished difference Result 1594 states and 2078 transitions. [2018-09-15 11:32:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:32:16,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 210 [2018-09-15 11:32:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:32:16,979 INFO L225 Difference]: With dead ends: 1594 [2018-09-15 11:32:16,980 INFO L226 Difference]: Without dead ends: 1238 [2018-09-15 11:32:16,982 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 137 SyntacticMatches, 60 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:32:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-09-15 11:32:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1235. [2018-09-15 11:32:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-09-15 11:32:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1444 transitions. [2018-09-15 11:32:17,047 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1444 transitions. Word has length 210 [2018-09-15 11:32:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:32:17,053 INFO L480 AbstractCegarLoop]: Abstraction has 1235 states and 1444 transitions. [2018-09-15 11:32:17,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 11:32:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1444 transitions. [2018-09-15 11:32:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-15 11:32:17,062 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:32:17,063 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:32:17,063 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:32:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1435948105, now seen corresponding path program 1 times [2018-09-15 11:32:17,064 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:32:17,064 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-09-15 11:32:17,064 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:32:17,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:32:17,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:32:18,380 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:32:31,752 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:32:31,752 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:32:31,761 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:32:35,775 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.95% of their original sizes. [2018-09-15 11:32:35,776 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:32:37,708 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:32:37,709 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:32:37,710 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:32:37,710 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:32:37,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:32:37,711 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:32:37,711 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:32:37,712 INFO L87 Difference]: Start difference. First operand 1235 states and 1444 transitions. Second operand 10 states. [2018-09-15 11:32:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:32:47,204 INFO L93 Difference]: Finished difference Result 1749 states and 2252 transitions. [2018-09-15 11:32:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 11:32:47,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2018-09-15 11:32:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:32:47,213 INFO L225 Difference]: With dead ends: 1749 [2018-09-15 11:32:47,213 INFO L226 Difference]: Without dead ends: 1393 [2018-09-15 11:32:47,215 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 150 SyntacticMatches, 60 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:32:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-09-15 11:32:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1383. [2018-09-15 11:32:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-09-15 11:32:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1610 transitions. [2018-09-15 11:32:47,276 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1610 transitions. Word has length 219 [2018-09-15 11:32:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:32:47,277 INFO L480 AbstractCegarLoop]: Abstraction has 1383 states and 1610 transitions. [2018-09-15 11:32:47,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:32:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1610 transitions. [2018-09-15 11:32:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-15 11:32:47,282 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:32:47,282 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:32:47,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:32:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1189102865, now seen corresponding path program 1 times [2018-09-15 11:32:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:32:47,283 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-15 11:32:47,283 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], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:32:47,286 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:32:47,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:32:48,882 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:33:07,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 11:33:07,929 INFO L272 AbstractInterpreter]: Visited 89 different actions 514 times. Merged at 7 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:33:07,936 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 11:33:07,977 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 11:33:07,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:33:07 BoogieIcfgContainer [2018-09-15 11:33:07,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 11:33:07,979 INFO L168 Benchmark]: Toolchain (without parser) took 201567.67 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -859.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:33:07,981 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-15 11:33:07,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-15 11:33:07,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.86 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-15 11:33:07,984 INFO L168 Benchmark]: Boogie Preprocessor took 272.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-15 11:33:07,985 INFO L168 Benchmark]: RCFGBuilder took 3681.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. [2018-09-15 11:33:07,986 INFO L168 Benchmark]: TraceAbstraction took 196696.81 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -162.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:33:07,992 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 772.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 137.86 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 272.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3681.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196696.81 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -162.9 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: 199]: 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 TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL 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 TRUE (((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)) [L199] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 196.6s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 53.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1454 SDtfs, 4843 SDslu, 1755 SDs, 0 SdLazy, 10395 SolverSat, 1185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.0s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1239 GetRequests, 820 SyntacticMatches, 300 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1383occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 109.3s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9945314169159276 AbsIntWeakeningRatio, 0.11824324324324324 AbsIntAvgWeakeningVarsNumRemoved, 81.3741554054054 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 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_label59_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_11-33-08-008.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label59_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_11-33-08-008.csv Received shutdown request...