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/Problem16_label57_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 12:31:02,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 12:31:02,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 12:31:02,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 12:31:02,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 12:31:02,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 12:31:02,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 12:31:02,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 12:31:02,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 12:31:02,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 12:31:02,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 12:31:02,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 12:31:02,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 12:31:02,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 12:31:02,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 12:31:02,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 12:31:02,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 12:31:02,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 12:31:02,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 12:31:02,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 12:31:02,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 12:31:02,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 12:31:02,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 12:31:02,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 12:31:02,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 12:31:02,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 12:31:02,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 12:31:02,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 12:31:02,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 12:31:02,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 12:31:02,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 12:31:02,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 12:31:02,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 12:31:02,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 12:31:02,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 12:31:02,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 12:31:02,232 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 12:31:02,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 12:31:02,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 12:31:02,249 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 12:31:02,250 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 12:31:02,250 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 12:31:02,250 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 12:31:02,250 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 12:31:02,250 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 12:31:02,251 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 12:31:02,251 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 12:31:02,251 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 12:31:02,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 12:31:02,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 12:31:02,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 12:31:02,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 12:31:02,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 12:31:02,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 12:31:02,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 12:31:02,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 12:31:02,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 12:31:02,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 12:31:02,254 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 12:31:02,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 12:31:02,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 12:31:02,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 12:31:02,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 12:31:02,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 12:31:02,255 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 12:31:02,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 12:31:02,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 12:31:02,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 12:31:02,256 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 12:31:02,256 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 12:31:02,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 12:31:02,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 12:31:02,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 12:31:02,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 12:31:02,334 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 12:31:02,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label57_true-unreach-call.c [2018-09-15 12:31:02,694 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8204968cf/4fb684cf88734a638352847530f4667d/FLAG84c0b70f4 [2018-09-15 12:31:03,088 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 12:31:03,090 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label57_true-unreach-call.c [2018-09-15 12:31:03,111 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8204968cf/4fb684cf88734a638352847530f4667d/FLAG84c0b70f4 [2018-09-15 12:31:03,136 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8204968cf/4fb684cf88734a638352847530f4667d [2018-09-15 12:31:03,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 12:31:03,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 12:31:03,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 12:31:03,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 12:31:03,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 12:31:03,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:31:03" (1/1) ... [2018-09-15 12:31:03,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4c6457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:03, skipping insertion in model container [2018-09-15 12:31:03,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:31:03" (1/1) ... [2018-09-15 12:31:03,185 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 12:31:04,059 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:31:04,079 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 12:31:04,316 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:31:04,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04 WrapperNode [2018-09-15 12:31:04,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 12:31:04,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 12:31:04,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 12:31:04,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 12:31:04,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:04,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:04,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 12:31:04,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 12:31:04,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 12:31:04,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 12:31:04,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:04,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:04,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:04,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:05,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:05,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:05,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (1/1) ... [2018-09-15 12:31:05,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 12:31:05,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 12:31:05,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 12:31:05,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 12:31:05,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (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 12:31:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 12:31:05,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 12:31:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-15 12:31:05,194 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-15 12:31:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 12:31:05,195 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 12:31:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 12:31:05,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 12:31:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 12:31:05,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 12:31:11,793 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 12:31:11,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:31:11 BoogieIcfgContainer [2018-09-15 12:31:11,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 12:31:11,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 12:31:11,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 12:31:11,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 12:31:11,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 12:31:03" (1/3) ... [2018-09-15 12:31:11,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54716c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:31:11, skipping insertion in model container [2018-09-15 12:31:11,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:31:04" (2/3) ... [2018-09-15 12:31:11,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54716c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:31:11, skipping insertion in model container [2018-09-15 12:31:11,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:31:11" (3/3) ... [2018-09-15 12:31:11,808 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label57_true-unreach-call.c [2018-09-15 12:31:11,819 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 12:31:11,831 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 12:31:11,896 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 12:31:11,897 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 12:31:11,897 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 12:31:11,898 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 12:31:11,898 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 12:31:11,898 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 12:31:11,898 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 12:31:11,898 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 12:31:11,898 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 12:31:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-15 12:31:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-15 12:31:11,951 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:31:11,953 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] [2018-09-15 12:31:11,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:31:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash -768030333, now seen corresponding path program 1 times [2018-09-15 12:31:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:31:11,963 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-09-15 12:31:11,966 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [1556], [1560], [1566], [1570], [1579], [1580], [1581], [1583] [2018-09-15 12:31:12,037 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:31:12,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:31:13,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:31:13,570 INFO L272 AbstractInterpreter]: Visited 46 different actions 46 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 12:31:13,589 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:31:14,255 INFO L232 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 80.36% of their original sizes. [2018-09-15 12:31:14,255 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:31:14,538 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:31:14,540 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:31:14,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 12:31:14,540 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:31:14,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 12:31:14,553 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 12:31:14,554 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:31:14,557 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 6 states. [2018-09-15 12:31:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:31:24,395 INFO L93 Difference]: Finished difference Result 1158 states and 2145 transitions. [2018-09-15 12:31:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 12:31:24,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-09-15 12:31:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:31:24,424 INFO L225 Difference]: With dead ends: 1158 [2018-09-15 12:31:24,424 INFO L226 Difference]: Without dead ends: 746 [2018-09-15 12:31:24,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:31:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-09-15 12:31:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-09-15 12:31:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-15 12:31:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1075 transitions. [2018-09-15 12:31:24,546 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1075 transitions. Word has length 47 [2018-09-15 12:31:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:31:24,547 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1075 transitions. [2018-09-15 12:31:24,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 12:31:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1075 transitions. [2018-09-15 12:31:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-15 12:31:24,554 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:31:24,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:24,556 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:31:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 54326240, now seen corresponding path program 1 times [2018-09-15 12:31:24,557 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:31:24,557 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-09-15 12:31:24,558 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-15 12:31:24,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:31:24,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:31:27,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:31:33,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:31:33,237 INFO L272 AbstractInterpreter]: Visited 99 different actions 191 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 12:31:33,278 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:31:36,775 INFO L232 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 78.38% of their original sizes. [2018-09-15 12:31:36,775 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:31:38,439 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:31:38,440 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:31:38,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:31:38,440 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:31:38,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:31:38,443 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:31:38,443 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:31:38,443 INFO L87 Difference]: Start difference. First operand 744 states and 1075 transitions. Second operand 11 states. [2018-09-15 12:31:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:31:57,719 INFO L93 Difference]: Finished difference Result 1826 states and 3140 transitions. [2018-09-15 12:31:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 12:31:57,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-09-15 12:31:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:31:57,729 INFO L225 Difference]: With dead ends: 1826 [2018-09-15 12:31:57,729 INFO L226 Difference]: Without dead ends: 1426 [2018-09-15 12:31:57,733 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 94 SyntacticMatches, 35 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:31:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-09-15 12:31:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1423. [2018-09-15 12:31:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-09-15 12:31:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1772 transitions. [2018-09-15 12:31:57,805 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1772 transitions. Word has length 139 [2018-09-15 12:31:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:31:57,806 INFO L480 AbstractCegarLoop]: Abstraction has 1423 states and 1772 transitions. [2018-09-15 12:31:57,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:31:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1772 transitions. [2018-09-15 12:31:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-15 12:31:57,811 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:31:57,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:57,812 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:31:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2028845976, now seen corresponding path program 1 times [2018-09-15 12:31:57,812 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:31:57,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-09-15 12:31:57,813 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-15 12:31:57,820 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:31:57,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:32:01,012 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:32:07,918 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:32:07,918 INFO L272 AbstractInterpreter]: Visited 135 different actions 263 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 12:32:07,936 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:32:11,458 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 78.15% of their original sizes. [2018-09-15 12:32:11,458 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:32:12,948 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:32:12,949 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:32:12,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:32:12,949 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:32:12,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:32:12,951 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:32:12,951 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:32:12,951 INFO L87 Difference]: Start difference. First operand 1423 states and 1772 transitions. Second operand 11 states. [2018-09-15 12:32:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:32:36,196 INFO L93 Difference]: Finished difference Result 2505 states and 3837 transitions. [2018-09-15 12:32:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 12:32:36,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2018-09-15 12:32:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:32:36,211 INFO L225 Difference]: With dead ends: 2505 [2018-09-15 12:32:36,212 INFO L226 Difference]: Without dead ends: 2105 [2018-09-15 12:32:36,214 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 130 SyntacticMatches, 35 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:32:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2018-09-15 12:32:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2102. [2018-09-15 12:32:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-09-15 12:32:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2469 transitions. [2018-09-15 12:32:36,301 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2469 transitions. Word has length 175 [2018-09-15 12:32:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:32:36,302 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2469 transitions. [2018-09-15 12:32:36,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:32:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2469 transitions. [2018-09-15 12:32:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-15 12:32:36,316 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:32:36,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:32:36,317 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:32:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash -495428703, now seen corresponding path program 1 times [2018-09-15 12:32:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:32:36,318 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-15 12:32:36,318 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1004], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-15 12:32:36,335 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:32:36,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:32:40,176 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:32:49,245 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:32:49,246 INFO L272 AbstractInterpreter]: Visited 160 different actions 313 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 12:32:49,266 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:32:52,297 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 78.04% of their original sizes. [2018-09-15 12:32:52,297 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:32:53,425 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:32:53,426 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:32:53,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 12:32:53,427 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:32:53,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 12:32:53,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 12:32:53,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 12:32:53,429 INFO L87 Difference]: Start difference. First operand 2102 states and 2469 transitions. Second operand 12 states. [2018-09-15 12:33:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:33:15,695 INFO L93 Difference]: Finished difference Result 3184 states and 4534 transitions. [2018-09-15 12:33:15,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 12:33:15,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 200 [2018-09-15 12:33:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:33:15,716 INFO L225 Difference]: With dead ends: 3184 [2018-09-15 12:33:15,717 INFO L226 Difference]: Without dead ends: 2784 [2018-09-15 12:33:15,720 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 154 SyntacticMatches, 35 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 12:33:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2018-09-15 12:33:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2781. [2018-09-15 12:33:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2018-09-15 12:33:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3166 transitions. [2018-09-15 12:33:15,826 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3166 transitions. Word has length 200 [2018-09-15 12:33:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:33:15,827 INFO L480 AbstractCegarLoop]: Abstraction has 2781 states and 3166 transitions. [2018-09-15 12:33:15,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 12:33:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3166 transitions. [2018-09-15 12:33:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-15 12:33:15,833 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:33:15,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:33:15,833 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:33:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2047194993, now seen corresponding path program 1 times [2018-09-15 12:33:15,834 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:33:15,834 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-09-15 12:33:15,835 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1164], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-15 12:33:15,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:33:15,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:33:34,176 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:33:34,176 INFO L272 AbstractInterpreter]: Visited 200 different actions 393 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 12:33:34,212 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:33:38,143 INFO L232 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 77.91% of their original sizes. [2018-09-15 12:33:38,144 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:33:39,288 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:33:39,288 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:33:39,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 12:33:39,288 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:33:39,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 12:33:39,289 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 12:33:39,289 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 12:33:39,290 INFO L87 Difference]: Start difference. First operand 2781 states and 3166 transitions. Second operand 12 states. [2018-09-15 12:33:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:33:55,833 INFO L93 Difference]: Finished difference Result 3863 states and 5231 transitions. [2018-09-15 12:33:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 12:33:55,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 240 [2018-09-15 12:33:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:33:55,849 INFO L225 Difference]: With dead ends: 3863 [2018-09-15 12:33:55,850 INFO L226 Difference]: Without dead ends: 3463 [2018-09-15 12:33:55,854 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 247 GetRequests, 194 SyntacticMatches, 35 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 12:33:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2018-09-15 12:33:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3460. [2018-09-15 12:33:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2018-09-15 12:33:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 3863 transitions. [2018-09-15 12:33:55,980 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 3863 transitions. Word has length 240 [2018-09-15 12:33:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:33:55,981 INFO L480 AbstractCegarLoop]: Abstraction has 3460 states and 3863 transitions. [2018-09-15 12:33:55,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 12:33:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 3863 transitions. [2018-09-15 12:33:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-09-15 12:33:55,987 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:33:55,988 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 12:33:55,988 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:33:55,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2016174395, now seen corresponding path program 1 times [2018-09-15 12:33:55,988 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:33:55,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-09-15 12:33:55,989 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-15 12:33:55,993 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:33:55,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:33:57,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:34:17,802 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:34:17,802 INFO L272 AbstractInterpreter]: Visited 136 different actions 665 times. Merged at 7 different actions 29 times. Never widened. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 12:34:17,809 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:34:19,845 INFO L232 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 77.89% of their original sizes. [2018-09-15 12:34:19,846 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:34:20,831 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:34:20,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:34:20,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:34:20,832 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:34:20,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:34:20,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:34:20,833 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:34:20,834 INFO L87 Difference]: Start difference. First operand 3460 states and 3863 transitions. Second operand 11 states. [2018-09-15 12:34:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:34:37,680 INFO L93 Difference]: Finished difference Result 4496 states and 5839 transitions. [2018-09-15 12:34:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-15 12:34:37,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 267 [2018-09-15 12:34:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:34:37,698 INFO L225 Difference]: With dead ends: 4496 [2018-09-15 12:34:37,698 INFO L226 Difference]: Without dead ends: 4096 [2018-09-15 12:34:37,702 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 276 GetRequests, 222 SyntacticMatches, 35 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-09-15 12:34:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2018-09-15 12:34:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3814. [2018-09-15 12:34:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3814 states. [2018-09-15 12:34:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 4252 transitions. [2018-09-15 12:34:37,850 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 4252 transitions. Word has length 267 [2018-09-15 12:34:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:34:37,850 INFO L480 AbstractCegarLoop]: Abstraction has 3814 states and 4252 transitions. [2018-09-15 12:34:37,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:34:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 4252 transitions. [2018-09-15 12:34:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-15 12:34:37,858 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:34:37,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:37,859 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:34:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 573264968, now seen corresponding path program 1 times [2018-09-15 12:34:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:34:37,859 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-09-15 12:34:37,860 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [455], [457], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-15 12:34:37,866 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:34:37,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 12:35:03,111 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 12:35:03,112 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 12:35:03,112 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 12:35:03,154 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 12:35:03,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 12:35:03 BoogieIcfgContainer [2018-09-15 12:35:03,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 12:35:03,155 INFO L168 Benchmark]: Toolchain (without parser) took 240003.15 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 12:35:03,157 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 12:35:03,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1249.93 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-09-15 12:35:03,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-15 12:35:03,159 INFO L168 Benchmark]: Boogie Preprocessor took 489.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -915.6 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. [2018-09-15 12:35:03,161 INFO L168 Benchmark]: RCFGBuilder took 6691.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.4 MB). Peak memory consumption was 272.4 MB. Max. memory is 7.1 GB. [2018-09-15 12:35:03,161 INFO L168 Benchmark]: TraceAbstraction took 231357.97 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-15 12:35:03,167 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 1249.93 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 203.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 489.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -915.6 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6691.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.4 MB). Peak memory consumption was 272.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231357.97 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 127]: 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: [L8] int inputB = 2; [L9] int inputE = 5; [L10] int inputD = 4; [L11] int inputF = 6; [L12] int inputC = 3; [L13] int inputA = 1; [L16] int a15 = 3; [L17] int a18 = -87; [L18] int a16 = 11; [L19] int a12 = 5; [L1770] int output = -1; [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND FALSE !(((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5)))) [L391] COND FALSE !(((a15==4) && ((a12==8) && ((a16==9) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L398] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && (((a16==8) && ((a15==4) && (input == 1))) && (a12==9)))) [L404] COND FALSE !(((a16==9) && (((input == 3) && ((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7)))) && (a15==4)))) [L411] COND FALSE !((((input == 1) && (((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9))) || (( a18 <= -156 && (a16==12)) && (a12==5)))) && (a15==3))) [L417] COND FALSE !(((a15==4) && ((a12==6) && ((a16==8) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L424] COND FALSE !(((a15==3) && ((a16==12) && ((a12==5) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L427] COND FALSE !((((a16==10) && (((input == 2) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))) && (a12==5))) [L434] COND FALSE !(((a16==11) && ((a15==3) && (((a12==8) && (input == 5)) && a18 <= -156 )))) [L440] COND FALSE !((((a16==8) && (((input == 4) && (a15==4)) && (a12==5))) && a18 <= -156 )) [L443] COND FALSE !(((a16==8) && (((((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9)))) && (input == 3)) && (a15==4)))) [L449] COND FALSE !((((((a12==5) && (input == 6)) && (a16==12)) && 134 < a18 ) && (a15==3))) [L454] COND FALSE !(((a15==4) && ((a16==9) && ((a12==6) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L457] COND FALSE !((((a15==3) && ((a16==11) && ((input == 3) && (a12==8)))) && a18 <= -156 )) [L463] COND FALSE !(((a15==3) && (( ((-79 < a18) && (134 >= a18)) && ((a16==12) && (input == 2))) && (a12==7)))) [L469] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)) && (a16==12)) && (a15==3)) && (a12==9))) [L476] COND FALSE !(((a12==9) && ((((input == 6) && a18 <= -156 ) && (a16==9)) && (a15==4)))) [L483] COND FALSE !(((a12==6) && ((a15==4) && (( 134 < a18 && (input == 3)) && (a16==10))))) [L489] COND FALSE !(((((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 2)) && (a12==6)) && (a16==12)) && (a15==3))) [L495] COND FALSE !(((a12==8) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==11)) && (a15==3)))) [L501] COND FALSE !(((a16==10) && ((a15==4) && ((a12==5) && ((input == 3) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )))))) [L508] COND FALSE !(((a15==4) && ((a16==9) && ((input == 2) && (((a12==5) && 134 < a18 ) || ( a18 <= -156 && (a12==6))))))) [L515] COND FALSE !(((((( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))) && (input == 5)) && (a15==3)) && (a16==12))) [L521] COND FALSE !(((a16==11) && ((a15==3) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (input == 3))))) [L527] COND FALSE !(((a15==4) && ((((input == 4) && a18 <= -156 ) && (a12==9)) && (a16==9)))) [L533] COND FALSE !(((a15==4) && (((a12==5) && ((input == 5) && a18 <= -156 )) && (a16==8)))) [L538] COND FALSE !((((((input == 2) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4)) && (a16==10))) [L543] COND FALSE !((((a15==3) && ((a12==5) && ((input == 6) && (a16==11)))) && ((-156 < a18) && (-79 >= a18)) )) [L548] COND FALSE !((((a15==4) && ((a16==9) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a12==8))) [L554] COND FALSE !(((a16==11) && ((a15==3) && ((input == 3) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 ))))))) [L560] COND FALSE !(((((a12==6) && ((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1))) && (a15==4)) && (a16==10))) [L567] COND FALSE !(((a15==4) && (((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) && (input == 6)) && (a12==7)) && (a16==8)))) [L573] COND FALSE !(((a12==6) && ((a15==3) && (((input == 6) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a16==12))))) [L578] COND FALSE !((((a15==4) && ( ((-79 < a18) && (134 >= a18)) && ((input == 5) && (a12==9)))) && (a16==8))) [L584] COND FALSE !(((a16==8) && ((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 3)) && (a12==5)) && (a15==4)))) [L589] COND FALSE !(((a16==12) && ((a12==5) && ((a15==3) && ((input == 6) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L594] COND FALSE !((((a12==7) && ((a15==4) && ((input == 4) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )))) && (a16==8))) [L600] COND FALSE !(((((input == 4) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L606] COND FALSE !((((a12==5) && ( ((-156 < a18) && (-79 >= a18)) && ((a15==4) && (input == 6)))) && (a16==10))) [L612] COND FALSE !(((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (((input == 3) && (a12==8)) && (a16==8))))) [L618] COND FALSE !((((a15==4) && ((input == 3) && (((a12==8) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==7)) || ((a12==8) && a18 <= -156 ))))) && (a16==8))) [L624] COND FALSE !(((a15==4) && ((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 ))) && (input == 4))))) [L631] COND FALSE !(((a16==8) && (( a18 <= -156 && ((input == 5) && (a15==4))) && (a12==6)))) [L636] COND FALSE !(((a16==8) && (((( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 6)) && (a15==4)) && (a12==5)))) [L641] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((input == 4) && (a15==3))) && (a16==12)) && (a12==8))) [L648] COND FALSE !(((((((a12==9) && ((a16==9) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==9) && 134 < a18 ))) || ((a12==5) && ((a16==10) && a18 <= -156 ))) && (input == 6)) && (a15==4))) [L655] COND FALSE !(((a12==9) && ((a15==4) && (((input == 4) && (a16==8)) && ((-79 < a18) && (134 >= a18)) )))) [L661] COND FALSE !(((((a16==12) && ((a15==3) && (input == 6))) && (a12==9)) && 134 < a18 )) [L664] COND FALSE !(((a12==7) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) && (input == 1)) && (a16==8))))) [L670] COND FALSE !(((a15==4) && ((((input == 5) && 134 < a18 ) && (a16==10)) && (a12==6)))) [L677] COND FALSE !((((a15==3) && (((input == 2) && (a12==9)) && 134 < a18 )) && (a16==12))) [L680] COND FALSE !(((((( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )) && (input == 3)) && (a15==3)) && (a16==12))) [L686] COND FALSE !((((((a16==11) && (input == 2)) && (a15==3)) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) )) [L691] COND FALSE !(((a12==5) && ((a16==12) && (((input == 3) && (a15==3)) && 134 < a18 )))) [L696] COND FALSE !((((a15==4) && ((a12==6) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==8))) [L703] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 5)) && (a15==3)) && (a12==5)) && (a16==12))) [L706] COND FALSE !((((a12==9) && (((a15==3) && (input == 4)) && 134 < a18 )) && (a16==12))) [L712] COND FALSE !(((a15==3) && ((a16==11) && ((a12==5) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1)))))) [L717] COND FALSE !(((a15==4) && ((((a12==9) && (input == 3)) && a18 <= -156 ) && (a16==9)))) [L723] COND FALSE !(((a12==5) && ((a15==4) && (((input == 1) && (a16==10)) && ((-156 < a18) && (-79 >= a18)) )))) [L728] COND FALSE !(((((a16==9) && ((input == 2) && (a15==4))) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L734] COND FALSE !((((a12==5) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 2)) && (a16==9))) && (a15==4))) [L741] COND FALSE !(((a15==3) && ((a16==11) && (((((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7))) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7))) && (input == 6))))) [L746] COND FALSE !((((a12==8) && ((a16==11) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)))) && (a15==3))) [L752] COND FALSE !(((a16==12) && (( 134 < a18 && ((a12==9) && (input == 3))) && (a15==3)))) [L758] COND FALSE !(((((a12==8) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4))) && (a15==4)) && (a16==9))) [L763] COND FALSE !(((((((a16==12) && a18 <= -156 ) && (a12==5)) || (((a12==9) && ((a16==11) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==11) && 134 < a18 )))) && (input == 5)) && (a15==3))) [L769] COND FALSE !(((a16==12) && (((a15==3) && ((input == 3) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a12==9)))) [L775] COND FALSE !((((((input == 4) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==12)) && (a12==5)) && (a15==3))) [L778] COND FALSE !(((a15==3) && (((( a18 <= -156 && (a16==12)) && (a12==5)) || ((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9)))) && (input == 2)))) [L784] COND FALSE !((((a12==6) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 5)))) && (a16==10))) [L789] COND FALSE !(((a15==4) && ((a16==9) && (((input == 5) && a18 <= -156 ) && (a12==9))))) [L796] COND FALSE !(((a15==3) && ((a12==9) && ((a16==12) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 4)))))) [L802] COND FALSE !((((((input == 2) && a18 <= -156 ) && (a16==9)) && (a15==4)) && (a12==9))) [L808] COND FALSE !((((((a12==9) && ((a16==8) && 134 < a18 )) || (( a18 <= -156 && (a16==9)) && (a12==5))) && (input == 4)) && (a15==4))) [L815] COND FALSE !(((a12==5) && ((a16==10) && (((input == 6) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))))) [L822] COND FALSE !(((((input == 6) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L828] COND FALSE !(((a15==3) && (((a12==8) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==11)))) [L834] COND FALSE !(((a16==12) && ((a15==3) && (((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 2))))) [L840] COND FALSE !(((a15==3) && ((((((a12==8) && 134 < a18 ) || ((a12==9) && a18 <= -156 )) || ((a12==9) && ((-156 < a18) && (-79 >= a18)) )) && (input == 6)) && (a16==11)))) [L846] COND FALSE !(((((a16==8) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 1))) && (a15==4)) && (a12==5))) [L851] COND FALSE !(((a12==8) && ((a16==11) && ((a15==3) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L857] COND FALSE !(((((input == 1) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )))) && (a15==3)) && (a16==11))) [L863] COND FALSE !((((((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1)) && (a12==6)) && (a15==3)) && (a16==11))) [L869] COND FALSE !(((((a12==8) && ((input == 2) && (a16==8))) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L875] COND FALSE !(((a15==4) && ((((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7))) && (input == 5)) && (a16==9)))) [L882] COND FALSE !((((((input == 4) && (a15==3)) && a18 <= -156 ) && (a12==8)) && (a16==11))) [L888] COND FALSE !((((a16==11) && (((a15==3) && (input == 2)) && a18 <= -156 )) && (a12==8))) [L894] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && ((a15==4) && (((a16==8) && (input == 4)) && (a12==7))))) [L899] COND FALSE !(((a16==12) && ((((input == 1) && ((-79 < a18) && (134 >= a18)) ) && (a15==3)) && (a12==8)))) [L905] COND FALSE !((((a15==4) && ((((a12==5) && 134 < a18 ) || ((a12==6) && a18 <= -156 )) && (input == 3))) && (a16==9))) [L912] COND FALSE !(((((a16==12) && ( 134 < a18 && (input == 4))) && (a15==3)) && (a12==5))) [L917] COND FALSE !(( ((-156 < a18) && (-79 >= a18)) && ((a15==3) && ((a12==5) && ((a16==11) && (input == 3)))))) [L922] COND FALSE !((((a15==4) && ((((a12==5) && 134 < a18 ) || ((a12==6) && a18 <= -156 )) && (input == 1))) && (a16==9))) [L929] COND FALSE !(((a15==3) && ((a16==12) && ((input == 4) && (((a12==8) && 134 < a18 ) || ((a12==9) && a18 <= -156 )))))) [L935] COND FALSE !(((a16==12) && ( ((-156 < a18) && (-79 >= a18)) && (((a12==7) && (input == 1)) && (a15==3))))) [L942] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((a12==7) && (input == 2))) && (a16==8)) && (a15==4))) [L948] COND FALSE !((((a12==7) && ( ((-79 < a18) && (134 >= a18)) && ((a15==4) && (input == 6)))) && (a16==8))) [L954] COND FALSE !(((a16==10) && ((((input == 4) && (a12==5)) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ))) [L961] COND FALSE !((((a16==12) && ((( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 )) && (input == 1))) && (a15==3))) [L967] COND FALSE !(((a12==5) && (((a16==10) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 4))) && (a15==4)))) [L974] COND FALSE !(((a16==12) && (((((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7))) && (input == 5)) && (a15==3)))) [L979] COND FALSE !((((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)) && (a12==6))) && (a15==4))) [L986] COND FALSE !(((a16==9) && ((a15==4) && ((input == 3) && (( a18 <= -156 && (a12==8)) || (( ((-79 < a18) && (134 >= a18)) && (a12==7)) || ( 134 < a18 && (a12==7)))))))) [L993] COND FALSE !(((a15==4) && (((input == 5) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) ))) && (a16==8)))) [L999] COND FALSE !(((a16==9) && (((a15==4) && ((input == 1) && a18 <= -156 )) && (a12==9)))) [L1005] COND FALSE !(((a12==6) && ((a16==9) && ((a15==4) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)))))) [L1011] COND FALSE !(((a15==4) && ((a16==10) && (((input == 4) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a12==6))))) [L1018] COND FALSE !(((((input == 5) && (((a12==8) && a18 <= -156 ) || (( ((-79 < a18) && (134 >= a18)) && (a12==7)) || ( 134 < a18 && (a12==7))))) && (a15==4)) && (a16==9))) [L1025] COND FALSE !(((a16==12) && ( ((-79 < a18) && (134 >= a18)) && (((input == 2) && (a15==3)) && (a12==8))))) [L1031] COND FALSE !(((a15==3) && (((a12==5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 2))) && (a16==12)))) [L1036] COND FALSE !((((a12==7) && ((a15==3) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 2)))) && (a16==11))) [L1042] COND FALSE !(((a12==6) && ((a15==3) && ((a16==12) && (( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 1)))))) [L1048] COND FALSE !((((a15==4) && ((input == 6) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 ))))) && (a16==9))) [L1055] COND FALSE !((((a15==3) && ((a16==12) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))) && (a12==9))) [L1061] COND FALSE !(((a15==4) && (((( a18 <= -156 && (a16==10)) && (a12==5)) || ((((a16==9) && ((-79 < a18) && (134 >= a18)) ) && (a12==9)) || (( 134 < a18 && (a16==9)) && (a12==9)))) && (input == 4)))) [L1067] COND FALSE !(((a15==3) && ((((a16==12) && (input == 1)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ))) [L1073] COND FALSE !(((a15==4) && (((a16==9) && ((input == 4) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a12==5)))) [L1079] COND FALSE !(((a15==4) && ((input == 3) && ((((a16==10) && a18 <= -156 ) && (a12==5)) || (((a12==9) && ( ((-79 < a18) && (134 >= a18)) && (a16==9))) || ((a12==9) && ((a16==9) && 134 < a18 ))))))) [L1086] COND FALSE !((((a15==3) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1)) && (a12==7))) && (a16==11))) [L1092] COND FALSE !((((a12==5) && ( 134 < a18 && ((a16==12) && (input == 2)))) && (a15==3))) [L1097] COND FALSE !((((input == 1) && ((((a16==8) && 134 < a18 ) && (a12==9)) || (((a16==9) && a18 <= -156 ) && (a12==5)))) && (a15==4))) [L1103] COND FALSE !(((a12==6) && (((a15==3) && ((input == 5) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ))) && (a16==12)))) [L1109] COND FALSE !((((a12==6) && ((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 5)) && (a16==11))) && (a15==3))) [L1114] COND FALSE !(((a16==12) && ((a15==3) && (( ((-79 < a18) && (134 >= a18)) && (input == 5)) && (a12==8))))) [L1120] COND FALSE !(((a12==6) && ((a16==11) && ((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 6)) && (a15==3))))) [L1125] COND FALSE !(((a12==8) && ((a15==3) && ( ((-79 < a18) && (134 >= a18)) && ((input == 3) && (a16==12)))))) [L1131] COND FALSE !((((a15==4) && (((input == 6) && (a16==8)) && (a12==9))) && ((-79 < a18) && (134 >= a18)) )) [L1137] COND FALSE !((((a16==9) && ((a12==5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)))) && (a15==4))) [L1143] COND FALSE !(((a15==4) && (((a12==6) && ((input == 3) && (a16==8))) && a18 <= -156 ))) [L1149] COND FALSE !(((a16==8) && ((a15==4) && ((a12==6) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L1155] COND FALSE !((((a16==9) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 2)) && (a15==4))) && (a12==8))) [L1160] COND FALSE !(((a12==5) && (((a16==9) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6))) && (a15==4)))) [L1166] COND FALSE !((((( a18 <= -156 && (input == 4)) && (a15==4)) && (a12==6)) && (a16==8))) [L1172] COND FALSE !(((a12==6) && (((a16==10) && ((input == 4) && 134 < a18 )) && (a15==4)))) [L1175] COND FALSE !((((a15==3) && ((input == 6) && (( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 )))) && (a16==12))) [L1181] COND FALSE !(((((a15==4) && ((input == 1) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ))) && (a12==7)) && (a16==8))) [L1187] COND FALSE !(((a15==3) && ((a16==11) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7)))) && (input == 4))))) [L1193] COND FALSE !((((input == 5) && ((((a12==9) && ( ((-79 < a18) && (134 >= a18)) && (a16==9))) || (((a16==9) && 134 < a18 ) && (a12==9))) || (( a18 <= -156 && (a16==10)) && (a12==5)))) && (a15==4))) [L1200] COND TRUE ((a12==5) && ((a16==11) && (((input == 1) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ))) [L1202] a12 = 6 [L1204] RET return 22; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND TRUE ((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9)) [L127] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. UNKNOWN Result, 231.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 108.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2434 SDtfs, 10092 SDslu, 1964 SDs, 0 SdLazy, 22598 SolverSat, 3550 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 98.6s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 1102 GetRequests, 836 SyntacticMatches, 175 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3814occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 98.8s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9947731738907124 AbsIntWeakeningRatio, 0.11299435028248588 AbsIntAvgWeakeningVarsNumRemoved, 139.14124293785312 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 296 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/Problem16_label57_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_12-35-03-184.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label57_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_12-35-03-184.csv Completed graceful shutdown