java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label14_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:23:51,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:23:51,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:23:51,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:23:51,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:23:51,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:23:51,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:23:51,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:23:51,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:23:51,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:23:51,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:23:51,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:23:51,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:23:51,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:23:51,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:23:51,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:23:51,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:23:51,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:23:51,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:23:51,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:23:51,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:23:51,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:23:51,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:23:51,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:23:51,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:23:51,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:23:51,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:23:51,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:23:51,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:23:51,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:23:51,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:23:51,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:23:51,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:23:51,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:23:51,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:23:51,808 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:23:51,808 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-19 03:23:51,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:23:51,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:23:51,828 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:23:51,828 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:23:51,828 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:23:51,828 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:23:51,828 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:23:51,829 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:23:51,829 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:23:51,829 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:23:51,829 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:23:51,829 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:23:51,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:23:51,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:23:51,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:23:51,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:23:51,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:23:51,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:23:51,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:23:51,831 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:23:51,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:23:51,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:23:51,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:23:51,832 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:23:51,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:23:51,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:23:51,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:23:51,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:23:51,833 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:23:51,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:23:51,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:23:51,834 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:23:51,834 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:23:51,834 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:23:51,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:23:51,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:23:51,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:23:51,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:23:51,902 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:23:51,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label14_true-unreach-call.c [2018-09-19 03:23:52,264 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5642c11a2/3f02a67dbc44471b93edfe0180e5a63f/FLAG2f8374e5c [2018-09-19 03:23:52,526 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:23:52,527 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label14_true-unreach-call.c [2018-09-19 03:23:52,546 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5642c11a2/3f02a67dbc44471b93edfe0180e5a63f/FLAG2f8374e5c [2018-09-19 03:23:52,561 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5642c11a2/3f02a67dbc44471b93edfe0180e5a63f [2018-09-19 03:23:52,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:23:52,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:23:52,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:23:52,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:23:52,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:23:52,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:23:52" (1/1) ... [2018-09-19 03:23:52,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c40084a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:52, skipping insertion in model container [2018-09-19 03:23:52,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:23:52" (1/1) ... [2018-09-19 03:23:52,601 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:23:53,106 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:23:53,124 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:23:53,272 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:23:53,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53 WrapperNode [2018-09-19 03:23:53,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:23:53,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:23:53,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:23:53,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:23:53,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:23:53,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:23:53,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:23:53,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:23:53,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... [2018-09-19 03:23:53,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:23:53,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:23:53,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:23:53,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:23:53,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:23:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:23:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:23:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:23:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:23:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:23:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:23:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:23:53,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:23:57,029 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:23:57,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:23:57 BoogieIcfgContainer [2018-09-19 03:23:57,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:23:57,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:23:57,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:23:57,035 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:23:57,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:23:52" (1/3) ... [2018-09-19 03:23:57,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430dba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:23:57, skipping insertion in model container [2018-09-19 03:23:57,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:23:53" (2/3) ... [2018-09-19 03:23:57,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430dba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:23:57, skipping insertion in model container [2018-09-19 03:23:57,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:23:57" (3/3) ... [2018-09-19 03:23:57,039 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label14_true-unreach-call.c [2018-09-19 03:23:57,050 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:23:57,059 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:23:57,114 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:23:57,114 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:23:57,115 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:23:57,115 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:23:57,115 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:23:57,115 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:23:57,116 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:23:57,116 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:23:57,116 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:23:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 03:23:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-19 03:23:57,155 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:23:57,157 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] [2018-09-19 03:23:57,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:23:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1440498332, now seen corresponding path program 1 times [2018-09-19 03:23:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:23:57,167 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-09-19 03:23:57,170 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 03:23:57,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:23:57,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:23:58,292 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:23:58,294 INFO L272 AbstractInterpreter]: Visited 37 different actions 37 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 03:23:58,308 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:23:58,905 INFO L232 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 75.09% of their original sizes. [2018-09-19 03:23:58,905 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:23:59,240 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:23:59,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:23:59,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:23:59,242 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:23:59,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:23:59,256 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:23:59,257 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:23:59,260 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 03:24:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:24:04,237 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 03:24:04,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:24:04,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-09-19 03:24:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:24:04,256 INFO L225 Difference]: With dead ends: 576 [2018-09-19 03:24:04,256 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 03:24:04,266 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:24:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 03:24:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 03:24:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 03:24:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 03:24:04,340 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 38 [2018-09-19 03:24:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:24:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 03:24:04,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:24:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 03:24:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-19 03:24:04,347 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:24:04,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:24:04,349 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:24:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1526433965, now seen corresponding path program 1 times [2018-09-19 03:24:04,349 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:24:04,350 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2018-09-19 03:24:04,350 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:24:04,363 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:24:04,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:24:05,874 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:24:08,833 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:24:08,834 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:24:08,840 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:24:09,720 INFO L232 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-19 03:24:09,721 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:24:10,237 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:24:10,238 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:24:10,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:24:10,238 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:24:10,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:24:10,239 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:24:10,240 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:24:10,240 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 03:24:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:24:18,570 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 03:24:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 03:24:18,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2018-09-19 03:24:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:24:18,579 INFO L225 Difference]: With dead ends: 717 [2018-09-19 03:24:18,579 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 03:24:18,583 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 03:24:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 03:24:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 03:24:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 03:24:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 03:24:18,621 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 109 [2018-09-19 03:24:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:24:18,622 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 03:24:18,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:24:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 03:24:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-19 03:24:18,628 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:24:18,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:24:18,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:24:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash -396511336, now seen corresponding path program 1 times [2018-09-19 03:24:18,629 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:24:18,629 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2018-09-19 03:24:18,629 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:24:18,634 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:24:18,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:24:22,607 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:24:24,653 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:24:24,653 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:24:24,662 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:24:25,568 INFO L232 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 03:24:25,568 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:24:26,502 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:24:26,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:24:26,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:24:26,503 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:24:26,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:24:26,504 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:24:26,504 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:24:26,504 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 13 states. [2018-09-19 03:24:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:24:37,690 INFO L93 Difference]: Finished difference Result 1333 states and 2076 transitions. [2018-09-19 03:24:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 03:24:37,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 118 [2018-09-19 03:24:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:24:37,700 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 03:24:37,700 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 03:24:37,703 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 03:24:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 03:24:37,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 03:24:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 03:24:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 943 transitions. [2018-09-19 03:24:37,754 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 943 transitions. Word has length 118 [2018-09-19 03:24:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:24:37,755 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 943 transitions. [2018-09-19 03:24:37,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:24:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 943 transitions. [2018-09-19 03:24:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-19 03:24:37,763 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:24:37,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:24:37,763 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:24:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1570919920, now seen corresponding path program 1 times [2018-09-19 03:24:37,764 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:24:37,764 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-09-19 03:24:37,765 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:24:37,770 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:24:37,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:24:40,363 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:24:46,734 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:24:46,734 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:24:46,739 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:24:47,667 INFO L232 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 03:24:47,667 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:24:48,239 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:24:48,239 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:24:48,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:24:48,240 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:24:48,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:24:48,240 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:24:48,241 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:24:48,242 INFO L87 Difference]: Start difference. First operand 762 states and 943 transitions. Second operand 12 states. [2018-09-19 03:24:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:24:57,959 INFO L93 Difference]: Finished difference Result 1677 states and 2200 transitions. [2018-09-19 03:24:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:24:57,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 154 [2018-09-19 03:24:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:24:57,966 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 03:24:57,966 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 03:24:57,969 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 162 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:24:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 03:24:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 03:24:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 03:24:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2018-09-19 03:24:58,008 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 154 [2018-09-19 03:24:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:24:58,009 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2018-09-19 03:24:58,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:24:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2018-09-19 03:24:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-19 03:24:58,013 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:24:58,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:24:58,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:24:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1391426259, now seen corresponding path program 1 times [2018-09-19 03:24:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:24:58,014 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-09-19 03:24:58,014 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:24:58,020 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:24:58,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:25:06,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:25:06,998 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:25:07,003 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:25:07,944 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 03:25:07,945 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:25:08,411 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:25:08,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:25:08,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:25:08,412 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:25:08,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:25:08,412 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:25:08,413 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:25:08,413 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand 12 states. [2018-09-19 03:25:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:25:17,375 INFO L93 Difference]: Finished difference Result 2268 states and 2879 transitions. [2018-09-19 03:25:17,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 03:25:17,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 173 [2018-09-19 03:25:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:25:17,384 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 03:25:17,384 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 03:25:17,387 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 03:25:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 03:25:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 03:25:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 03:25:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1605 transitions. [2018-09-19 03:25:17,436 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1605 transitions. Word has length 173 [2018-09-19 03:25:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:25:17,437 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1605 transitions. [2018-09-19 03:25:17,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:25:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1605 transitions. [2018-09-19 03:25:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-19 03:25:17,440 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:25:17,440 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:25:17,441 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:25:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash -407511473, now seen corresponding path program 1 times [2018-09-19 03:25:17,441 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:25:17,441 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-09-19 03:25:17,442 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:25:17,445 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:25:17,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:25:18,642 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:25:23,040 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:25:23,041 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:25:23,044 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:25:24,220 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 03:25:24,221 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:25:24,549 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:25:24,550 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:25:24,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:25:24,550 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:25:24,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:25:24,551 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:25:24,551 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:25:24,551 INFO L87 Difference]: Start difference. First operand 1352 states and 1605 transitions. Second operand 10 states. [2018-09-19 03:25:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:25:29,494 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2018-09-19 03:25:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:25:29,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2018-09-19 03:25:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:25:29,516 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 03:25:29,516 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 03:25:29,521 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:25:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 03:25:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 03:25:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 03:25:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1772 transitions. [2018-09-19 03:25:29,583 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1772 transitions. Word has length 185 [2018-09-19 03:25:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:25:29,584 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1772 transitions. [2018-09-19 03:25:29,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:25:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1772 transitions. [2018-09-19 03:25:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-19 03:25:29,589 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:25:29,589 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:25:29,590 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:25:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1999172720, now seen corresponding path program 1 times [2018-09-19 03:25:29,590 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:25:29,590 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-09-19 03:25:29,591 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:25:29,595 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:25:29,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:25:32,658 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:25:36,360 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:25:36,360 INFO L272 AbstractInterpreter]: Visited 88 different actions 341 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 03:25:36,368 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:25:37,421 INFO L232 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 03:25:37,422 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:25:37,907 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:25:37,907 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:25:37,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:25:37,907 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:25:37,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:25:37,908 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:25:37,908 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:25:37,908 INFO L87 Difference]: Start difference. First operand 1503 states and 1772 transitions. Second operand 13 states. [2018-09-19 03:25:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:25:44,469 INFO L93 Difference]: Finished difference Result 3686 states and 4637 transitions. [2018-09-19 03:25:44,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:25:44,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2018-09-19 03:25:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:25:44,488 INFO L225 Difference]: With dead ends: 3686 [2018-09-19 03:25:44,489 INFO L226 Difference]: Without dead ends: 2337 [2018-09-19 03:25:44,493 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:25:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-09-19 03:25:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2189. [2018-09-19 03:25:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-09-19 03:25:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2615 transitions. [2018-09-19 03:25:44,582 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2615 transitions. Word has length 196 [2018-09-19 03:25:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:25:44,583 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2615 transitions. [2018-09-19 03:25:44,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:25:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2615 transitions. [2018-09-19 03:25:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-19 03:25:44,587 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:25:44,588 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:25:44,588 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:25:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash 311603004, now seen corresponding path program 1 times [2018-09-19 03:25:44,588 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:25:44,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-19 03:25:44,589 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:25:44,591 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:25:44,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:25:47,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:26:00,422 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:26:00,423 INFO L272 AbstractInterpreter]: Visited 96 different actions 555 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:26:00,434 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:26:01,673 INFO L232 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 03:26:01,673 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:26:02,132 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:26:02,133 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:26:02,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:26:02,133 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:26:02,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:26:02,134 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:26:02,134 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:26:02,134 INFO L87 Difference]: Start difference. First operand 2189 states and 2615 transitions. Second operand 13 states. [2018-09-19 03:26:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:26:11,091 INFO L93 Difference]: Finished difference Result 5360 states and 6747 transitions. [2018-09-19 03:26:11,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:26:11,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 206 [2018-09-19 03:26:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:26:11,105 INFO L225 Difference]: With dead ends: 5360 [2018-09-19 03:26:11,106 INFO L226 Difference]: Without dead ends: 3325 [2018-09-19 03:26:11,112 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:26:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2018-09-19 03:26:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3019. [2018-09-19 03:26:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2018-09-19 03:26:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3715 transitions. [2018-09-19 03:26:11,210 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3715 transitions. Word has length 206 [2018-09-19 03:26:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:26:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 3019 states and 3715 transitions. [2018-09-19 03:26:11,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:26:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3715 transitions. [2018-09-19 03:26:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 03:26:11,215 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:26:11,215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:26:11,216 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:26:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash 360016784, now seen corresponding path program 1 times [2018-09-19 03:26:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:26:11,216 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 03:26:11,217 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:26:11,220 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:26:11,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:26:12,551 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:26:21,166 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:26:21,166 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:26:21,175 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:26:22,291 INFO L232 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 73.2% of their original sizes. [2018-09-19 03:26:22,291 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:26:22,825 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:26:22,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:26:22,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:26:22,826 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:26:22,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:26:22,827 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:26:22,827 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:26:22,827 INFO L87 Difference]: Start difference. First operand 3019 states and 3715 transitions. Second operand 13 states. [2018-09-19 03:26:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:26:30,119 INFO L93 Difference]: Finished difference Result 6300 states and 8063 transitions. [2018-09-19 03:26:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:26:30,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 222 [2018-09-19 03:26:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:26:30,135 INFO L225 Difference]: With dead ends: 6300 [2018-09-19 03:26:30,136 INFO L226 Difference]: Without dead ends: 3435 [2018-09-19 03:26:30,143 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:26:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-09-19 03:26:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3305. [2018-09-19 03:26:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-09-19 03:26:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4062 transitions. [2018-09-19 03:26:30,244 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4062 transitions. Word has length 222 [2018-09-19 03:26:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:26:30,245 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 4062 transitions. [2018-09-19 03:26:30,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:26:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4062 transitions. [2018-09-19 03:26:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-19 03:26:30,250 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:26:30,250 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:26:30,250 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:26:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 342960195, now seen corresponding path program 1 times [2018-09-19 03:26:30,251 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:26:30,251 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-09-19 03:26:30,251 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:26:30,254 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:26:30,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:26:32,540 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:26:43,199 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:26:43,199 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:26:43,207 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:26:44,382 INFO L232 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-19 03:26:44,383 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:26:44,647 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:26:44,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:26:44,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:26:44,647 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:26:44,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:26:44,648 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:26:44,648 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:26:44,648 INFO L87 Difference]: Start difference. First operand 3305 states and 4062 transitions. Second operand 10 states. [2018-09-19 03:26:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:26:51,393 INFO L93 Difference]: Finished difference Result 6634 states and 8307 transitions. [2018-09-19 03:26:51,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:26:51,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 227 [2018-09-19 03:26:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:26:51,407 INFO L225 Difference]: With dead ends: 6634 [2018-09-19 03:26:51,408 INFO L226 Difference]: Without dead ends: 3483 [2018-09-19 03:26:51,415 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:26:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-09-19 03:26:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3457. [2018-09-19 03:26:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-09-19 03:26:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4260 transitions. [2018-09-19 03:26:51,526 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4260 transitions. Word has length 227 [2018-09-19 03:26:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:26:51,527 INFO L480 AbstractCegarLoop]: Abstraction has 3457 states and 4260 transitions. [2018-09-19 03:26:51,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:26:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4260 transitions. [2018-09-19 03:26:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-19 03:26:51,532 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:26:51,532 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:26:51,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:26:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1120176688, now seen corresponding path program 1 times [2018-09-19 03:26:51,533 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:26:51,533 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-19 03:26:51,534 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:26:51,537 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:26:51,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:26:55,309 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:27:06,276 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:06,276 INFO L272 AbstractInterpreter]: Visited 118 different actions 687 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:27:06,284 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:07,824 INFO L232 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-19 03:27:07,824 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:08,562 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:08,562 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:08,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:27:08,562 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:08,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:27:08,563 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:27:08,564 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:27:08,564 INFO L87 Difference]: Start difference. First operand 3457 states and 4260 transitions. Second operand 13 states. [2018-09-19 03:27:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:27:15,900 INFO L93 Difference]: Finished difference Result 8601 states and 11011 transitions. [2018-09-19 03:27:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:27:15,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 228 [2018-09-19 03:27:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:27:15,924 INFO L225 Difference]: With dead ends: 8601 [2018-09-19 03:27:15,925 INFO L226 Difference]: Without dead ends: 5298 [2018-09-19 03:27:15,933 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 240 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:27:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2018-09-19 03:27:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 4845. [2018-09-19 03:27:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-09-19 03:27:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 6065 transitions. [2018-09-19 03:27:16,068 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 6065 transitions. Word has length 228 [2018-09-19 03:27:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:27:16,068 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 6065 transitions. [2018-09-19 03:27:16,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:27:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 6065 transitions. [2018-09-19 03:27:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-19 03:27:16,074 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:16,075 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:27:16,075 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1049666656, now seen corresponding path program 1 times [2018-09-19 03:27:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:16,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-09-19 03:27:16,076 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:27:16,079 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:16,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:18,467 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:27:32,389 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:32,390 INFO L272 AbstractInterpreter]: Visited 124 different actions 723 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:27:32,396 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:33,597 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 73.17% of their original sizes. [2018-09-19 03:27:33,597 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:33,926 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:33,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:33,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 03:27:33,927 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:33,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 03:27:33,927 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 03:27:33,928 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 03:27:33,928 INFO L87 Difference]: Start difference. First operand 4845 states and 6065 transitions. Second operand 11 states. [2018-09-19 03:27:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:27:38,716 INFO L93 Difference]: Finished difference Result 9755 states and 12399 transitions. [2018-09-19 03:27:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:27:38,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2018-09-19 03:27:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:27:38,738 INFO L225 Difference]: With dead ends: 9755 [2018-09-19 03:27:38,739 INFO L226 Difference]: Without dead ends: 5064 [2018-09-19 03:27:38,748 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 03:27:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2018-09-19 03:27:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5004. [2018-09-19 03:27:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5004 states. [2018-09-19 03:27:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 6279 transitions. [2018-09-19 03:27:38,896 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 6279 transitions. Word has length 236 [2018-09-19 03:27:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:27:38,897 INFO L480 AbstractCegarLoop]: Abstraction has 5004 states and 6279 transitions. [2018-09-19 03:27:38,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 03:27:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 6279 transitions. [2018-09-19 03:27:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-19 03:27:38,906 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:38,906 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:27:38,906 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1666202905, now seen corresponding path program 1 times [2018-09-19 03:27:38,907 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:38,907 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-09-19 03:27:38,907 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:27:38,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:38,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:41,575 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:27:55,356 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:55,356 INFO L272 AbstractInterpreter]: Visited 124 different actions 723 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:27:55,364 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:56,669 INFO L232 lantSequenceWeakener]: Weakened 255 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 03:27:56,669 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:56,958 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:56,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:56,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:27:56,958 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:56,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:27:56,959 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:27:56,959 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:27:56,959 INFO L87 Difference]: Start difference. First operand 5004 states and 6279 transitions. Second operand 10 states. [2018-09-19 03:28:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:01,927 INFO L93 Difference]: Finished difference Result 10208 states and 12992 transitions. [2018-09-19 03:28:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:28:01,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 257 [2018-09-19 03:28:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:01,951 INFO L225 Difference]: With dead ends: 10208 [2018-09-19 03:28:01,951 INFO L226 Difference]: Without dead ends: 5358 [2018-09-19 03:28:01,963 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 264 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:28:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states. [2018-09-19 03:28:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 5314. [2018-09-19 03:28:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-09-19 03:28:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 6691 transitions. [2018-09-19 03:28:02,110 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 6691 transitions. Word has length 257 [2018-09-19 03:28:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:02,111 INFO L480 AbstractCegarLoop]: Abstraction has 5314 states and 6691 transitions. [2018-09-19 03:28:02,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:28:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 6691 transitions. [2018-09-19 03:28:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-19 03:28:02,120 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:02,121 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:28:02,121 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:02,121 INFO L82 PathProgramCache]: Analyzing trace with hash -563705373, now seen corresponding path program 1 times [2018-09-19 03:28:02,121 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:02,122 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-09-19 03:28:02,122 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:02,124 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:02,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:05,155 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 03:28:09,209 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 03:28:09,209 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 03:28:09,210 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:28:09,246 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:28:09,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:28:09 BoogieIcfgContainer [2018-09-19 03:28:09,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:28:09,247 INFO L168 Benchmark]: Toolchain (without parser) took 256673.84 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:28:09,249 INFO L168 Benchmark]: CDTParser took 0.19 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-19 03:28:09,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 03:28:09,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 03:28:09,251 INFO L168 Benchmark]: Boogie Preprocessor took 224.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -863.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 03:28:09,252 INFO L168 Benchmark]: RCFGBuilder took 3353.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. [2018-09-19 03:28:09,253 INFO L168 Benchmark]: TraceAbstraction took 252214.55 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -817.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:28:09,258 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 224.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -863.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3353.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252214.55 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -817.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L222] a19 = 10 [L224] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND TRUE (((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L97] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 252.1s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 95.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2552 SDtfs, 13485 SDslu, 4352 SDs, 0 SdLazy, 25590 SolverSat, 3035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.7s Time, PredicateUnifierStatistics: 26 DeclaredPredicates, 2462 GetRequests, 2216 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5314occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 135.3s AbstIntTime, 14 AbstIntIterations, 13 AbstIntStrong, 0.9940897585142675 AbsIntWeakeningRatio, 0.1292808219178082 AbsIntAvgWeakeningVarsNumRemoved, 889.6789383561644 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1432 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label14_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-28-09-273.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label14_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-28-09-273.csv Completed graceful shutdown