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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label21_true-unreach-call.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-dace188-m
[2018-09-15 16:48:21,481 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-09-15 16:48:21,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-09-15 16:48:21,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-09-15 16:48:21,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-09-15 16:48:21,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-09-15 16:48:21,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-09-15 16:48:21,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-09-15 16:48:21,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-09-15 16:48:21,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-09-15 16:48:21,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-09-15 16:48:21,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-09-15 16:48:21,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-09-15 16:48:21,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-09-15 16:48:21,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-09-15 16:48:21,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-09-15 16:48:21,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-09-15 16:48:21,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-09-15 16:48:21,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-09-15 16:48:21,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-09-15 16:48:21,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-09-15 16:48:21,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-09-15 16:48:21,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-09-15 16:48:21,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-09-15 16:48:21,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-09-15 16:48:21,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-09-15 16:48:21,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-09-15 16:48:21,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-09-15 16:48:21,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-09-15 16:48:21,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-09-15 16:48:21,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-09-15 16:48:21,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-09-15 16:48:21,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-09-15 16:48:21,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-09-15 16:48:21,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-09-15 16:48:21,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-09-15 16:48:21,554 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf
[2018-09-15 16:48:21,584 INFO L110 SettingsManager]: Loading preferences was successful
[2018-09-15 16:48:21,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-09-15 16:48:21,585 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-09-15 16:48:21,585 INFO L133 SettingsManager]: * User list type=DISABLED
[2018-09-15 16:48:21,586 INFO L133 SettingsManager]: * calls to implemented procedures=false
[2018-09-15 16:48:21,586 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-09-15 16:48:21,586 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-09-15 16:48:21,586 INFO L133 SettingsManager]: * Octagon Domain=false
[2018-09-15 16:48:21,586 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain
[2018-09-15 16:48:21,587 INFO L133 SettingsManager]: * Log string format=TERM
[2018-09-15 16:48:21,587 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true
[2018-09-15 16:48:21,587 INFO L133 SettingsManager]: * Interval Domain=false
[2018-09-15 16:48:21,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-09-15 16:48:21,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-09-15 16:48:21,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-09-15 16:48:21,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-09-15 16:48:21,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-09-15 16:48:21,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-09-15 16:48:21,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-09-15 16:48:21,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-09-15 16:48:21,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-09-15 16:48:21,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-09-15 16:48:21,593 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-09-15 16:48:21,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-09-15 16:48:21,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-09-15 16:48:21,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-09-15 16:48:21,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-09-15 16:48:21,594 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-09-15 16:48:21,595 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN
[2018-09-15 16:48:21,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-09-15 16:48:21,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-09-15 16:48:21,595 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-09-15 16:48:21,595 INFO L133 SettingsManager]: * To the following directory=dump/
[2018-09-15 16:48:21,596 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES
[2018-09-15 16:48:21,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-09-15 16:48:21,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-09-15 16:48:21,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-09-15 16:48:21,687 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-09-15 16:48:21,688 INFO L276 PluginConnector]: CDTParser initialized
[2018-09-15 16:48:21,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label21_true-unreach-call.c
[2018-09-15 16:48:22,024 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccdd18af/78b299b1862a4555a8164bdc30f5ebae/FLAG215396728
[2018-09-15 16:48:22,298 INFO L277 CDTParser]: Found 1 translation units.
[2018-09-15 16:48:22,298 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label21_true-unreach-call.c
[2018-09-15 16:48:22,313 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccdd18af/78b299b1862a4555a8164bdc30f5ebae/FLAG215396728
[2018-09-15 16:48:22,330 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccdd18af/78b299b1862a4555a8164bdc30f5ebae
[2018-09-15 16:48:22,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-09-15 16:48:22,344 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2018-09-15 16:48:22,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-09-15 16:48:22,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-09-15 16:48:22,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-09-15 16:48:22,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:48:22" (1/1) ...
[2018-09-15 16:48:22,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c40084a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:22, skipping insertion in model container
[2018-09-15 16:48:22,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:48:22" (1/1) ...
[2018-09-15 16:48:22,367 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode
[2018-09-15 16:48:22,848 INFO L170 PostProcessor]: Settings: Checked method=main
[2018-09-15 16:48:22,868 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode
[2018-09-15 16:48:23,000 INFO L170 PostProcessor]: Settings: Checked method=main
[2018-09-15 16:48:23,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23 WrapperNode
[2018-09-15 16:48:23,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-09-15 16:48:23,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-09-15 16:48:23,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-09-15 16:48:23,057 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-09-15 16:48:23,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-09-15 16:48:23,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-09-15 16:48:23,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-09-15 16:48:23,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-09-15 16:48:23,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (1/1) ...
[2018-09-15 16:48:23,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-09-15 16:48:23,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-09-15 16:48:23,418 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-09-15 16:48:23,418 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-09-15 16:48:23,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (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 16:48:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-09-15 16:48:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-09-15 16:48:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output
[2018-09-15 16:48:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output
[2018-09-15 16:48:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-09-15 16:48:23,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-09-15 16:48:23,495 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2018-09-15 16:48:23,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2018-09-15 16:48:27,126 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-09-15 16:48:27,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:48:27 BoogieIcfgContainer
[2018-09-15 16:48:27,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-09-15 16:48:27,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-09-15 16:48:27,129 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-09-15 16:48:27,132 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-09-15 16:48:27,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 04:48:22" (1/3) ...
[2018-09-15 16:48:27,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430dba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:48:27, skipping insertion in model container
[2018-09-15 16:48:27,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:48:23" (2/3) ...
[2018-09-15 16:48:27,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430dba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:48:27, skipping insertion in model container
[2018-09-15 16:48:27,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:48:27" (3/3) ...
[2018-09-15 16:48:27,136 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label21_true-unreach-call.c
[2018-09-15 16:48:27,149 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-09-15 16:48:27,163 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-09-15 16:48:27,217 INFO L130 ementStrategyFactory]: Using default assertion order modulation
[2018-09-15 16:48:27,218 INFO L381 AbstractCegarLoop]: Interprodecural is true
[2018-09-15 16:48:27,218 INFO L382 AbstractCegarLoop]: Hoare is true
[2018-09-15 16:48:27,218 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-09-15 16:48:27,218 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-09-15 16:48:27,219 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-09-15 16:48:27,219 INFO L386 AbstractCegarLoop]: Difference is false
[2018-09-15 16:48:27,219 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-09-15 16:48:27,219 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-09-15 16:48:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states.
[2018-09-15 16:48:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-09-15 16:48:27,259 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:27,260 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]
[2018-09-15 16:48:27,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 763875860, now seen corresponding path program 1 times
[2018-09-15 16:48:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:27,270 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions:
[2018-09-15 16:48:27,272 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], [173], [175], [796], [800], [806], [810], [817], [818], [819], [821]
[2018-09-15 16:48:27,304 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:27,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:27,486 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2018-09-15 16:48:27,488 INFO L272 AbstractInterpreter]: Visited 33 different actions 33 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables.
[2018-09-15 16:48:27,496 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates
[2018-09-15 16:48:27,606 INFO L232 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 74.12% of their original sizes.
[2018-09-15 16:48:27,606 INFO L412 sIntCurrentIteration]: Unifying AI predicates
[2018-09-15 16:48:27,772 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-09-15 16:48:27,773 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-15 16:48:27,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-09-15 16:48:27,774 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-09-15 16:48:27,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-09-15 16:48:27,787 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-09-15 16:48:27,787 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-09-15 16:48:27,790 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states.
[2018-09-15 16:48:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-15 16:48:29,942 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions.
[2018-09-15 16:48:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-09-15 16:48:29,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34
[2018-09-15 16:48:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-15 16:48:29,962 INFO L225 Difference]: With dead ends: 576
[2018-09-15 16:48:29,963 INFO L226 Difference]: Without dead ends: 358
[2018-09-15 16:48:29,971 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-09-15 16:48:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2018-09-15 16:48:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356.
[2018-09-15 16:48:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states.
[2018-09-15 16:48:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions.
[2018-09-15 16:48:30,044 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 34
[2018-09-15 16:48:30,044 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-15 16:48:30,045 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions.
[2018-09-15 16:48:30,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-09-15 16:48:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions.
[2018-09-15 16:48:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2018-09-15 16:48:30,051 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:30,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:30,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1453618365, now seen corresponding path program 1 times
[2018-09-15 16:48:30,052 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:30,052 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions:
[2018-09-15 16:48:30,053 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], [173], [175], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822]
[2018-09-15 16:48:30,057 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:30,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:30,209 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2018-09-15 16:48:30,209 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 16:48:30,251 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates
[2018-09-15 16:48:30,424 INFO L232 lantSequenceWeakener]: Weakened 102 states. On average, predicates are now at 73.32% of their original sizes.
[2018-09-15 16:48:30,424 INFO L412 sIntCurrentIteration]: Unifying AI predicates
[2018-09-15 16:48:31,078 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-09-15 16:48:31,078 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-15 16:48:31,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-09-15 16:48:31,079 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-09-15 16:48:31,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-09-15 16:48:31,080 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-09-15 16:48:31,080 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2018-09-15 16:48:31,081 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states.
[2018-09-15 16:48:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-15 16:48:35,463 INFO L93 Difference]: Finished difference Result 719 states and 1134 transitions.
[2018-09-15 16:48:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-09-15 16:48:35,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105
[2018-09-15 16:48:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-15 16:48:35,478 INFO L225 Difference]: With dead ends: 719
[2018-09-15 16:48:35,479 INFO L226 Difference]: Without dead ends: 513
[2018-09-15 16:48:35,482 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2018-09-15 16:48:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states.
[2018-09-15 16:48:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504.
[2018-09-15 16:48:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states.
[2018-09-15 16:48:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 662 transitions.
[2018-09-15 16:48:35,543 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 662 transitions. Word has length 105
[2018-09-15 16:48:35,543 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-15 16:48:35,544 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 662 transitions.
[2018-09-15 16:48:35,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-09-15 16:48:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 662 transitions.
[2018-09-15 16:48:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2018-09-15 16:48:35,549 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:35,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:35,550 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1676021384, now seen corresponding path program 1 times
[2018-09-15 16:48:35,550 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:35,550 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions:
[2018-09-15 16:48:35,551 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], [173], [175], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822]
[2018-09-15 16:48:35,554 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:35,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:35,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2018-09-15 16:48:35,641 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 16:48:35,679 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates
[2018-09-15 16:48:35,877 INFO L232 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 73.36% of their original sizes.
[2018-09-15 16:48:35,877 INFO L412 sIntCurrentIteration]: Unifying AI predicates
[2018-09-15 16:48:36,526 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-09-15 16:48:36,527 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-15 16:48:36,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-09-15 16:48:36,527 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-09-15 16:48:36,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-09-15 16:48:36,528 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-09-15 16:48:36,528 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2018-09-15 16:48:36,528 INFO L87 Difference]: Start difference. First operand 504 states and 662 transitions. Second operand 9 states.
[2018-09-15 16:48:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-15 16:48:41,397 INFO L93 Difference]: Finished difference Result 1139 states and 1712 transitions.
[2018-09-15 16:48:41,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-09-15 16:48:41,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114
[2018-09-15 16:48:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-15 16:48:41,407 INFO L225 Difference]: With dead ends: 1139
[2018-09-15 16:48:41,407 INFO L226 Difference]: Without dead ends: 785
[2018-09-15 16:48:41,409 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2018-09-15 16:48:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states.
[2018-09-15 16:48:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 778.
[2018-09-15 16:48:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states.
[2018-09-15 16:48:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 957 transitions.
[2018-09-15 16:48:41,436 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 957 transitions. Word has length 114
[2018-09-15 16:48:41,436 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-15 16:48:41,436 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 957 transitions.
[2018-09-15 16:48:41,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-09-15 16:48:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 957 transitions.
[2018-09-15 16:48:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2018-09-15 16:48:41,441 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:41,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:41,442 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1275256064, now seen corresponding path program 1 times
[2018-09-15 16:48:41,442 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:41,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions:
[2018-09-15 16:48:41,443 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], [173], [175], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822]
[2018-09-15 16:48:41,446 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:41,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:41,590 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2018-09-15 16:48:41,591 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 16:48:41,631 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates
[2018-09-15 16:48:41,807 INFO L232 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 73.21% of their original sizes.
[2018-09-15 16:48:41,807 INFO L412 sIntCurrentIteration]: Unifying AI predicates
[2018-09-15 16:48:42,050 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-09-15 16:48:42,051 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-15 16:48:42,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-09-15 16:48:42,051 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-09-15 16:48:42,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-09-15 16:48:42,052 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-09-15 16:48:42,052 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2018-09-15 16:48:42,053 INFO L87 Difference]: Start difference. First operand 778 states and 957 transitions. Second operand 9 states.
[2018-09-15 16:48:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-15 16:48:45,232 INFO L93 Difference]: Finished difference Result 1563 states and 2059 transitions.
[2018-09-15 16:48:45,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-09-15 16:48:45,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150
[2018-09-15 16:48:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-15 16:48:45,240 INFO L225 Difference]: With dead ends: 1563
[2018-09-15 16:48:45,241 INFO L226 Difference]: Without dead ends: 935
[2018-09-15 16:48:45,243 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2018-09-15 16:48:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states.
[2018-09-15 16:48:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 928.
[2018-09-15 16:48:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states.
[2018-09-15 16:48:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1133 transitions.
[2018-09-15 16:48:45,286 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1133 transitions. Word has length 150
[2018-09-15 16:48:45,286 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-15 16:48:45,286 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1133 transitions.
[2018-09-15 16:48:45,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-09-15 16:48:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1133 transitions.
[2018-09-15 16:48:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2018-09-15 16:48:45,291 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:45,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:45,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -218739005, now seen corresponding path program 1 times
[2018-09-15 16:48:45,294 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:45,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions:
[2018-09-15 16:48:45,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], [173], [175], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822]
[2018-09-15 16:48:45,305 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:45,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:45,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2018-09-15 16:48:45,525 INFO L272 AbstractInterpreter]: Visited 142 different actions 414 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables.
[2018-09-15 16:48:45,551 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates
[2018-09-15 16:48:45,643 INFO L232 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 73.06% of their original sizes.
[2018-09-15 16:48:45,643 INFO L412 sIntCurrentIteration]: Unifying AI predicates
[2018-09-15 16:48:45,843 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-09-15 16:48:45,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-15 16:48:45,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-09-15 16:48:45,844 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-09-15 16:48:45,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-09-15 16:48:45,845 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-09-15 16:48:45,845 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2018-09-15 16:48:45,846 INFO L87 Difference]: Start difference. First operand 928 states and 1133 transitions. Second operand 9 states.
[2018-09-15 16:48:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-15 16:48:48,389 INFO L93 Difference]: Finished difference Result 1942 states and 2573 transitions.
[2018-09-15 16:48:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-09-15 16:48:48,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169
[2018-09-15 16:48:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-15 16:48:48,402 INFO L225 Difference]: With dead ends: 1942
[2018-09-15 16:48:48,402 INFO L226 Difference]: Without dead ends: 1164
[2018-09-15 16:48:48,405 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2018-09-15 16:48:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states.
[2018-09-15 16:48:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1157.
[2018-09-15 16:48:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states.
[2018-09-15 16:48:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1390 transitions.
[2018-09-15 16:48:48,442 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1390 transitions. Word has length 169
[2018-09-15 16:48:48,442 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-15 16:48:48,442 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1390 transitions.
[2018-09-15 16:48:48,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-09-15 16:48:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1390 transitions.
[2018-09-15 16:48:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2018-09-15 16:48:48,446 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:48,447 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2018-09-15 16:48:48,447 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1248106004, now seen corresponding path program 1 times
[2018-09-15 16:48:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:48,448 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions:
[2018-09-15 16:48:48,448 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], [173], [175], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822]
[2018-09-15 16:48:48,449 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:48,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:48,543 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2018-09-15 16:48:48,543 INFO L272 AbstractInterpreter]: Visited 95 different actions 368 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables.
[2018-09-15 16:48:48,584 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates
[2018-09-15 16:48:48,683 INFO L232 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 75.38% of their original sizes.
[2018-09-15 16:48:48,683 INFO L412 sIntCurrentIteration]: Unifying AI predicates
[2018-09-15 16:48:49,116 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-09-15 16:48:49,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-15 16:48:49,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-09-15 16:48:49,118 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-09-15 16:48:49,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-09-15 16:48:49,119 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-09-15 16:48:49,119 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2018-09-15 16:48:49,119 INFO L87 Difference]: Start difference. First operand 1157 states and 1390 transitions. Second operand 9 states.
[2018-09-15 16:48:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-15 16:48:51,738 INFO L93 Difference]: Finished difference Result 2420 states and 3040 transitions.
[2018-09-15 16:48:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-09-15 16:48:51,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192
[2018-09-15 16:48:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-15 16:48:51,749 INFO L225 Difference]: With dead ends: 2420
[2018-09-15 16:48:51,749 INFO L226 Difference]: Without dead ends: 1413
[2018-09-15 16:48:51,753 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2018-09-15 16:48:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2018-09-15 16:48:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1392.
[2018-09-15 16:48:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states.
[2018-09-15 16:48:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1678 transitions.
[2018-09-15 16:48:51,798 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1678 transitions. Word has length 192
[2018-09-15 16:48:51,799 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-15 16:48:51,799 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1678 transitions.
[2018-09-15 16:48:51,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-09-15 16:48:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1678 transitions.
[2018-09-15 16:48:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2018-09-15 16:48:51,804 INFO L368 BasicCegarLoop]: Found error trace
[2018-09-15 16:48:51,804 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 16:48:51,804 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-09-15 16:48:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1848492480, now seen corresponding path program 1 times
[2018-09-15 16:48:51,805 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy
[2018-09-15 16:48:51,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions:
[2018-09-15 16:48:51,806 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], [173], [175], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [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-15 16:48:51,808 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain
[2018-09-15 16:48:51,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2)
[2018-09-15 16:48:51,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2018-09-15 16:48:51,964 INFO L272 AbstractInterpreter]: Visited 122 different actions 473 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables.
[2018-09-15 16:48:52,003 INFO L443 BasicCegarLoop]: Counterexample might be feasible
[2018-09-15 16:48:52,055 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually.
[2018-09-15 16:48:52,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 04:48:52 BoogieIcfgContainer
[2018-09-15 16:48:52,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-09-15 16:48:52,056 INFO L168 Benchmark]: Toolchain (without parser) took 29714.63 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -220.3 MB). Peak memory consumption was 880.7 MB. Max. memory is 7.1 GB.
[2018-09-15 16:48:52,058 INFO L168 Benchmark]: CDTParser took 0.19 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 16:48:52,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.63 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 16:48:52,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2018-09-15 16:48:52,061 INFO L168 Benchmark]: Boogie Preprocessor took 246.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -850.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB.
[2018-09-15 16:48:52,062 INFO L168 Benchmark]: RCFGBuilder took 3709.33 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: 110.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB.
[2018-09-15 16:48:52,063 INFO L168 Benchmark]: TraceAbstraction took 24926.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 332.9 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 477.7 MB). Peak memory consumption was 810.6 MB. Max. memory is 7.1 GB.
[2018-09-15 16:48:52,068 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 710.63 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 113.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 246.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -850.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 3709.33 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: 110.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 24926.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 332.9 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 477.7 MB). Peak memory consumption was 810.6 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 85]: 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 TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))
[L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1)
[L410] a10 = 0
[L411] a19 = 8
[L413] 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 TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))
[L85] __VERIFIER_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 24.8s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1221 SDtfs, 3673 SDslu, 1732 SDs, 0 SdLazy, 9541 SolverSat, 1133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 793 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1392occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9962875212894841 AbsIntWeakeningRatio, 0.158311345646438 AbsIntAvgWeakeningVarsNumRemoved, 7.931398416886544 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 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_label21_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_16-48-52-084.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label21_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_16-48-52-084.csv
Received shutdown request...