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_label39_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 12:27:22,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 12:27:22,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 12:27:22,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 12:27:22,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 12:27:22,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 12:27:22,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 12:27:22,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 12:27:22,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 12:27:22,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 12:27:22,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 12:27:22,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 12:27:22,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 12:27:22,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 12:27:22,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 12:27:22,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 12:27:22,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 12:27:22,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 12:27:22,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 12:27:22,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 12:27:22,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 12:27:22,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 12:27:22,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 12:27:22,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 12:27:22,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 12:27:22,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 12:27:22,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 12:27:22,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 12:27:22,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 12:27:22,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 12:27:22,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 12:27:22,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 12:27:22,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 12:27:22,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 12:27:22,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 12:27:22,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 12:27:22,790 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:27:22,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 12:27:22,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 12:27:22,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 12:27:22,820 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 12:27:22,820 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 12:27:22,820 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 12:27:22,820 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 12:27:22,820 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 12:27:22,821 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 12:27:22,821 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 12:27:22,821 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 12:27:22,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 12:27:22,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 12:27:22,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 12:27:22,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 12:27:22,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 12:27:22,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 12:27:22,824 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 12:27:22,824 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 12:27:22,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 12:27:22,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 12:27:22,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 12:27:22,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 12:27:22,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 12:27:22,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 12:27:22,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 12:27:22,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 12:27:22,826 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 12:27:22,826 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 12:27:22,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 12:27:22,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 12:27:22,827 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 12:27:22,827 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 12:27:22,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 12:27:22,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 12:27:22,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 12:27:22,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 12:27:22,894 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 12:27:22,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label39_true-unreach-call.c [2018-09-15 12:27:23,248 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd30c74ea/9f348de59b204580bcc0997baa0066bb/FLAGf7d7a5946 [2018-09-15 12:27:23,615 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 12:27:23,616 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label39_true-unreach-call.c [2018-09-15 12:27:23,632 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd30c74ea/9f348de59b204580bcc0997baa0066bb/FLAGf7d7a5946 [2018-09-15 12:27:23,648 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd30c74ea/9f348de59b204580bcc0997baa0066bb [2018-09-15 12:27:23,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 12:27:23,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 12:27:23,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 12:27:23,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 12:27:23,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 12:27:23,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:27:23" (1/1) ... [2018-09-15 12:27:23,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dbb45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:23, skipping insertion in model container [2018-09-15 12:27:23,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:27:23" (1/1) ... [2018-09-15 12:27:23,690 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 12:27:24,445 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:27:24,463 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 12:27:24,700 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:27:24,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24 WrapperNode [2018-09-15 12:27:24,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 12:27:24,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 12:27:24,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 12:27:24,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 12:27:24,809 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:27:24" (1/1) ... [2018-09-15 12:27:24,852 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:27:24" (1/1) ... [2018-09-15 12:27:24,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 12:27:24,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 12:27:24,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 12:27:24,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 12:27:25,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (1/1) ... [2018-09-15 12:27:25,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 12:27:25,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 12:27:25,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 12:27:25,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 12:27:25,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (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:27:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 12:27:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 12:27:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-15 12:27:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-15 12:27:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 12:27:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 12:27:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 12:27:25,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 12:27:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 12:27:25,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 12:27:31,364 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 12:27:31,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:27:31 BoogieIcfgContainer [2018-09-15 12:27:31,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 12:27:31,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 12:27:31,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 12:27:31,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 12:27:31,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 12:27:23" (1/3) ... [2018-09-15 12:27:31,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b56df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:27:31, skipping insertion in model container [2018-09-15 12:27:31,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:27:24" (2/3) ... [2018-09-15 12:27:31,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b56df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:27:31, skipping insertion in model container [2018-09-15 12:27:31,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:27:31" (3/3) ... [2018-09-15 12:27:31,378 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label39_true-unreach-call.c [2018-09-15 12:27:31,388 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 12:27:31,399 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 12:27:31,471 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 12:27:31,472 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 12:27:31,472 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 12:27:31,472 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 12:27:31,472 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 12:27:31,472 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 12:27:31,473 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 12:27:31,473 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 12:27:31,473 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 12:27:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-15 12:27:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-15 12:27:31,523 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:27:31,525 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:27:31,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:27:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1251899380, now seen corresponding path program 1 times [2018-09-15 12:27:31,534 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:27:31,535 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-09-15 12:27:31,537 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], [459], [467], [475], [483], [491], [499], [507], [515], [523], [527], [529], [1556], [1560], [1566], [1570], [1579], [1580], [1581], [1583] [2018-09-15 12:27:31,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:27:31,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:27:33,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:27:33,034 INFO L272 AbstractInterpreter]: Visited 55 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 12:27:33,081 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:27:33,711 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 80.6% of their original sizes. [2018-09-15 12:27:33,711 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:27:33,987 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:27:33,989 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:27:33,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 12:27:33,989 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:27:33,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 12:27:34,002 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 12:27:34,003 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:27:34,005 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 6 states. [2018-09-15 12:27:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:27:43,207 INFO L93 Difference]: Finished difference Result 1158 states and 2145 transitions. [2018-09-15 12:27:43,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 12:27:43,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-09-15 12:27:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:27:43,232 INFO L225 Difference]: With dead ends: 1158 [2018-09-15 12:27:43,232 INFO L226 Difference]: Without dead ends: 746 [2018-09-15 12:27:43,243 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 51 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:27:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-09-15 12:27:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-09-15 12:27:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-15 12:27:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1075 transitions. [2018-09-15 12:27:43,350 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1075 transitions. Word has length 56 [2018-09-15 12:27:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:27:43,351 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1075 transitions. [2018-09-15 12:27:43,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 12:27:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1075 transitions. [2018-09-15 12:27:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-15 12:27:43,359 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:27:43,359 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:43,360 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:27:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash -128625010, now seen corresponding path program 1 times [2018-09-15 12:27:43,360 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:27:43,360 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-09-15 12:27:43,361 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], [459], [467], [475], [483], [491], [499], [507], [515], [523], [527], [529], [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:27:43,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:27:43,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:27:46,466 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:27:51,933 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:27:51,933 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:27:51,968 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:27:55,089 INFO L232 lantSequenceWeakener]: Weakened 146 states. On average, predicates are now at 78.59% of their original sizes. [2018-09-15 12:27:55,089 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:27:56,901 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:27:56,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:27:56,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:27:56,902 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:27:56,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:27:56,904 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:27:56,905 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:27:56,905 INFO L87 Difference]: Start difference. First operand 744 states and 1075 transitions. Second operand 11 states. [2018-09-15 12:28:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:28:14,059 INFO L93 Difference]: Finished difference Result 1826 states and 3140 transitions. [2018-09-15 12:28:14,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 12:28:14,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 148 [2018-09-15 12:28:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:28:14,070 INFO L225 Difference]: With dead ends: 1826 [2018-09-15 12:28:14,070 INFO L226 Difference]: Without dead ends: 1426 [2018-09-15 12:28:14,073 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 94 SyntacticMatches, 44 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:28:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-09-15 12:28:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1423. [2018-09-15 12:28:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-09-15 12:28:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1772 transitions. [2018-09-15 12:28:14,157 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1772 transitions. Word has length 148 [2018-09-15 12:28:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:28:14,160 INFO L480 AbstractCegarLoop]: Abstraction has 1423 states and 1772 transitions. [2018-09-15 12:28:14,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:28:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1772 transitions. [2018-09-15 12:28:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-15 12:28:14,174 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:28:14,174 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:14,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:28:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1408969606, now seen corresponding path program 1 times [2018-09-15 12:28:14,178 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:28:14,179 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-15 12:28:14,179 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], [459], [467], [475], [483], [491], [499], [507], [515], [523], [527], [529], [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:28:14,190 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:28:14,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:28:17,168 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:28:23,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:28:23,974 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:28:23,984 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:28:27,612 INFO L232 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 78.33% of their original sizes. [2018-09-15 12:28:27,615 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:28:28,958 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:28:28,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:28:28,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:28:28,959 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:28:28,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:28:28,959 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:28:28,960 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:28:28,960 INFO L87 Difference]: Start difference. First operand 1423 states and 1772 transitions. Second operand 11 states. [2018-09-15 12:28:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:28:43,736 INFO L93 Difference]: Finished difference Result 2505 states and 3837 transitions. [2018-09-15 12:28:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 12:28:43,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2018-09-15 12:28:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:28:43,758 INFO L225 Difference]: With dead ends: 2505 [2018-09-15 12:28:43,759 INFO L226 Difference]: Without dead ends: 2105 [2018-09-15 12:28:43,762 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 130 SyntacticMatches, 44 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:28:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2018-09-15 12:28:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2102. [2018-09-15 12:28:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-09-15 12:28:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2469 transitions. [2018-09-15 12:28:43,834 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2469 transitions. Word has length 184 [2018-09-15 12:28:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:28:43,835 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2469 transitions. [2018-09-15 12:28:43,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:28:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2469 transitions. [2018-09-15 12:28:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-15 12:28:43,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:28:43,840 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:43,840 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:28:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2042081329, now seen corresponding path program 1 times [2018-09-15 12:28:43,841 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:28:43,841 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-09-15 12:28:43,841 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], [459], [467], [475], [483], [491], [499], [507], [515], [523], [527], [529], [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:28:43,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:28:43,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:28:46,947 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:28:54,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:28:54,533 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:28:54,541 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:28:57,405 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 78.2% of their original sizes. [2018-09-15 12:28:57,405 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:28:58,633 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:28:58,633 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:28:58,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 12:28:58,634 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:28:58,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 12:28:58,635 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 12:28:58,635 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 12:28:58,636 INFO L87 Difference]: Start difference. First operand 2102 states and 2469 transitions. Second operand 12 states. [2018-09-15 12:29:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:29:25,111 INFO L93 Difference]: Finished difference Result 3184 states and 4534 transitions. [2018-09-15 12:29:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 12:29:25,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 209 [2018-09-15 12:29:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:29:25,125 INFO L225 Difference]: With dead ends: 3184 [2018-09-15 12:29:25,125 INFO L226 Difference]: Without dead ends: 2784 [2018-09-15 12:29:25,128 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 154 SyntacticMatches, 44 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 12:29:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2018-09-15 12:29:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2781. [2018-09-15 12:29:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2018-09-15 12:29:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3166 transitions. [2018-09-15 12:29:25,221 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3166 transitions. Word has length 209 [2018-09-15 12:29:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:29:25,222 INFO L480 AbstractCegarLoop]: Abstraction has 2781 states and 3166 transitions. [2018-09-15 12:29:25,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 12:29:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3166 transitions. [2018-09-15 12:29:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-15 12:29:25,227 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:29:25,227 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:25,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:29:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1529530623, now seen corresponding path program 1 times [2018-09-15 12:29:25,228 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:29:25,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-09-15 12:29:25,229 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], [459], [467], [475], [483], [491], [499], [507], [515], [523], [527], [529], [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:29:25,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:29:25,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:29:39,351 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:29:39,351 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:29:39,359 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:29:42,604 INFO L232 lantSequenceWeakener]: Weakened 247 states. On average, predicates are now at 78.05% of their original sizes. [2018-09-15 12:29:42,605 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:29:43,879 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:29:43,880 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:29:43,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 12:29:43,880 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:29:43,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 12:29:43,882 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 12:29:43,882 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 12:29:43,882 INFO L87 Difference]: Start difference. First operand 2781 states and 3166 transitions. Second operand 12 states. [2018-09-15 12:29:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:29:59,686 INFO L93 Difference]: Finished difference Result 3863 states and 5231 transitions. [2018-09-15 12:29:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 12:29:59,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 249 [2018-09-15 12:29:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:29:59,702 INFO L225 Difference]: With dead ends: 3863 [2018-09-15 12:29:59,702 INFO L226 Difference]: Without dead ends: 3463 [2018-09-15 12:29:59,705 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 256 GetRequests, 194 SyntacticMatches, 44 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 12:29:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2018-09-15 12:29:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3460. [2018-09-15 12:29:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2018-09-15 12:29:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 3863 transitions. [2018-09-15 12:29:59,811 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 3863 transitions. Word has length 249 [2018-09-15 12:29:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:29:59,812 INFO L480 AbstractCegarLoop]: Abstraction has 3460 states and 3863 transitions. [2018-09-15 12:29:59,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 12:29:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 3863 transitions. [2018-09-15 12:29:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-15 12:29:59,817 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:29:59,818 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:29:59,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:29:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1291527672, now seen corresponding path program 1 times [2018-09-15 12:29:59,818 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:29:59,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-09-15 12:29:59,819 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], [459], [467], [475], [483], [491], [499], [507], [515], [523], [527], [529], [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:29:59,822 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:29:59,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:30:01,622 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:30:20,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 12:30:20,637 INFO L272 AbstractInterpreter]: Visited 137 different actions 668 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:30:20,651 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 12:30:20,690 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 12:30:20,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 12:30:20 BoogieIcfgContainer [2018-09-15 12:30:20,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 12:30:20,691 INFO L168 Benchmark]: Toolchain (without parser) took 177030.33 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -961.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 12:30:20,693 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 12:30:20,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1132.74 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:30:20,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 180.34 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:30:20,696 INFO L168 Benchmark]: Boogie Preprocessor took 449.52 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -979.3 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2018-09-15 12:30:20,696 INFO L168 Benchmark]: RCFGBuilder took 5937.52 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 252.5 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. [2018-09-15 12:30:20,697 INFO L168 Benchmark]: TraceAbstraction took 169323.25 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -361.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-15 12:30:20,703 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1132.74 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 180.34 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 449.52 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -979.3 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5937.52 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 252.5 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 169323.25 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -361.8 MB). 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: 154]: 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 TRUE ((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5)) [L334] a18 = ((((a18 - -528844) - -67556) * -1)/ 10) [L335] a16 = 8 [L337] RET return -1; [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, 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 TRUE (((a15==3) && ((a12==5) && ((input == 6) && (a16==11)))) && ((-156 < a18) && (-79 >= a18)) ) [L544] a18 = ((((a18 * 10)/ 5) + -596729) * 1) [L545] a16 = 8 [L547] RET return -1; [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 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 TRUE ((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5)) [L154] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. UNKNOWN Result, 169.2s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 83.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2033 SDtfs, 7045 SDslu, 1467 SDs, 0 SdLazy, 17327 SolverSat, 2793 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 76.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 871 GetRequests, 623 SyntacticMatches, 176 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3460occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 65.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.994801972054725 AbsIntWeakeningRatio, 0.1117717003567182 AbsIntAvgWeakeningVarsNumRemoved, 77.72294887039239 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 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_label39_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_12-30-20-725.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label39_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_12-30-20-725.csv Received shutdown request...