/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:00:33,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:00:33,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:00:33,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:00:33,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:00:33,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:00:33,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:00:33,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:00:33,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:00:33,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:00:33,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:00:33,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:00:33,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:00:33,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:00:33,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:00:33,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:00:33,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:00:33,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:00:33,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:00:33,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:00:33,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:00:33,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:00:33,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:00:33,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:00:33,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:00:33,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:00:33,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:00:33,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:00:33,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:00:33,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:00:33,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:00:33,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:00:33,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:00:33,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:00:33,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:00:33,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:00:33,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:00:33,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:00:33,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:00:33,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:00:33,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:00:33,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-24 15:00:33,977 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:00:33,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:00:33,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:00:33,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:00:33,981 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:00:33,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:00:33,982 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:00:33,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:00:33,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:00:33,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:00:33,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:00:33,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:00:33,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:00:33,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:00:33,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:00:33,983 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:00:33,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:00:33,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:00:33,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:00:33,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:00:33,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:00:33,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:00:33,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:00:33,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:00:33,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:00:33,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:00:33,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:00:33,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:00:33,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:00:33,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-24 15:00:34,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:00:34,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:00:34,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:00:34,529 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:00:34,529 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:00:34,531 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-09-24 15:00:34,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ebb74eeed/104b3c170a81475d9dc3e105ebdbe9b2/FLAG57864beb6 [2020-09-24 15:00:35,247 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:00:35,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-09-24 15:00:35,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ebb74eeed/104b3c170a81475d9dc3e105ebdbe9b2/FLAG57864beb6 [2020-09-24 15:00:35,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ebb74eeed/104b3c170a81475d9dc3e105ebdbe9b2 [2020-09-24 15:00:35,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:00:35,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:00:35,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:00:35,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:00:35,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:00:35,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:00:35" (1/1) ... [2020-09-24 15:00:35,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad15a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:35, skipping insertion in model container [2020-09-24 15:00:35,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:00:35" (1/1) ... [2020-09-24 15:00:35,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:00:35,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:00:36,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:00:36,044 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:00:36,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:00:36,302 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:00:36,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36 WrapperNode [2020-09-24 15:00:36,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:00:36,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:00:36,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:00:36,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:00:36,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... [2020-09-24 15:00:36,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:00:36,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:00:36,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:00:36,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:00:36,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-24 15:00:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:00:36,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:00:36,547 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:00:36,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:00:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:00:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:00:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:00:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:00:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:00:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:00:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:00:37,872 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:00:37,872 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:00:37,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:00:37 BoogieIcfgContainer [2020-09-24 15:00:37,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:00:37,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:00:37,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:00:37,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:00:37,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:00:35" (1/3) ... [2020-09-24 15:00:37,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155318f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:00:37, skipping insertion in model container [2020-09-24 15:00:37,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:36" (2/3) ... [2020-09-24 15:00:37,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155318f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:00:37, skipping insertion in model container [2020-09-24 15:00:37,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:00:37" (3/3) ... [2020-09-24 15:00:37,893 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label50.c [2020-09-24 15:00:37,907 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:00:37,919 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:00:37,944 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:00:37,986 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:00:37,986 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:00:37,986 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:00:37,987 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:00:37,987 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:00:37,987 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:00:37,987 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:00:37,987 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:00:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2020-09-24 15:00:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-24 15:00:38,042 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:38,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:38,044 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 249673445, now seen corresponding path program 1 times [2020-09-24 15:00:38,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:38,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878987595] [2020-09-24 15:00:38,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:38,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:38,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878987595] [2020-09-24 15:00:38,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:38,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:00:38,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435932548] [2020-09-24 15:00:38,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:38,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:38,811 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 5 states. [2020-09-24 15:00:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:41,033 INFO L93 Difference]: Finished difference Result 1259 states and 1658 transitions. [2020-09-24 15:00:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-24 15:00:41,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2020-09-24 15:00:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:41,062 INFO L225 Difference]: With dead ends: 1259 [2020-09-24 15:00:41,062 INFO L226 Difference]: Without dead ends: 685 [2020-09-24 15:00:41,075 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:00:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-09-24 15:00:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 603. [2020-09-24 15:00:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2020-09-24 15:00:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 725 transitions. [2020-09-24 15:00:41,178 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 725 transitions. Word has length 107 [2020-09-24 15:00:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:41,179 INFO L479 AbstractCegarLoop]: Abstraction has 603 states and 725 transitions. [2020-09-24 15:00:41,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 725 transitions. [2020-09-24 15:00:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-24 15:00:41,187 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:41,187 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:00:41,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:00:41,188 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash -191439372, now seen corresponding path program 1 times [2020-09-24 15:00:41,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:41,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002304095] [2020-09-24 15:00:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:41,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002304095] [2020-09-24 15:00:41,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:41,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-24 15:00:41,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494174602] [2020-09-24 15:00:41,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:00:41,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:00:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:00:41,425 INFO L87 Difference]: Start difference. First operand 603 states and 725 transitions. Second operand 8 states. [2020-09-24 15:00:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:43,553 INFO L93 Difference]: Finished difference Result 1436 states and 1760 transitions. [2020-09-24 15:00:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:00:43,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2020-09-24 15:00:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:43,561 INFO L225 Difference]: With dead ends: 1436 [2020-09-24 15:00:43,561 INFO L226 Difference]: Without dead ends: 857 [2020-09-24 15:00:43,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-09-24 15:00:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-09-24 15:00:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 748. [2020-09-24 15:00:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2020-09-24 15:00:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 916 transitions. [2020-09-24 15:00:43,602 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 916 transitions. Word has length 128 [2020-09-24 15:00:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:43,603 INFO L479 AbstractCegarLoop]: Abstraction has 748 states and 916 transitions. [2020-09-24 15:00:43,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:00:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 916 transitions. [2020-09-24 15:00:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-24 15:00:43,607 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:43,607 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:00:43,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:00:43,608 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash 851491254, now seen corresponding path program 1 times [2020-09-24 15:00:43,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:43,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557570318] [2020-09-24 15:00:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:43,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:43,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:43,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557570318] [2020-09-24 15:00:43,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:43,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:00:43,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251955232] [2020-09-24 15:00:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:43,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:43,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:43,909 INFO L87 Difference]: Start difference. First operand 748 states and 916 transitions. Second operand 5 states. [2020-09-24 15:00:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:45,971 INFO L93 Difference]: Finished difference Result 1936 states and 2480 transitions. [2020-09-24 15:00:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:00:45,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2020-09-24 15:00:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:45,980 INFO L225 Difference]: With dead ends: 1936 [2020-09-24 15:00:45,980 INFO L226 Difference]: Without dead ends: 1212 [2020-09-24 15:00:45,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:00:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-09-24 15:00:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 895. [2020-09-24 15:00:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2020-09-24 15:00:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1095 transitions. [2020-09-24 15:00:46,024 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1095 transitions. Word has length 128 [2020-09-24 15:00:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:46,025 INFO L479 AbstractCegarLoop]: Abstraction has 895 states and 1095 transitions. [2020-09-24 15:00:46,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1095 transitions. [2020-09-24 15:00:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-09-24 15:00:46,029 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:46,029 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:00:46,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:00:46,030 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1459519869, now seen corresponding path program 1 times [2020-09-24 15:00:46,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:46,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1686072602] [2020-09-24 15:00:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:46,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:46,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:46,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1686072602] [2020-09-24 15:00:46,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:46,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:00:46,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445904598] [2020-09-24 15:00:46,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:46,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:46,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:46,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:46,245 INFO L87 Difference]: Start difference. First operand 895 states and 1095 transitions. Second operand 5 states. [2020-09-24 15:00:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:48,153 INFO L93 Difference]: Finished difference Result 2429 states and 3092 transitions. [2020-09-24 15:00:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:00:48,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-09-24 15:00:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:48,167 INFO L225 Difference]: With dead ends: 2429 [2020-09-24 15:00:48,167 INFO L226 Difference]: Without dead ends: 1558 [2020-09-24 15:00:48,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:00:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2020-09-24 15:00:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1324. [2020-09-24 15:00:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2020-09-24 15:00:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1687 transitions. [2020-09-24 15:00:48,243 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1687 transitions. Word has length 132 [2020-09-24 15:00:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:48,245 INFO L479 AbstractCegarLoop]: Abstraction has 1324 states and 1687 transitions. [2020-09-24 15:00:48,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1687 transitions. [2020-09-24 15:00:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-09-24 15:00:48,256 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:48,257 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:00:48,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:00:48,257 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -645015236, now seen corresponding path program 1 times [2020-09-24 15:00:48,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:48,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [691743318] [2020-09-24 15:00:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:48,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:48,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:48,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [691743318] [2020-09-24 15:00:48,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:48,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-24 15:00:48,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378874828] [2020-09-24 15:00:48,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:00:48,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:00:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:00:48,608 INFO L87 Difference]: Start difference. First operand 1324 states and 1687 transitions. Second operand 9 states. [2020-09-24 15:00:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:52,674 INFO L93 Difference]: Finished difference Result 3713 states and 4901 transitions. [2020-09-24 15:00:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-24 15:00:52,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2020-09-24 15:00:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:52,691 INFO L225 Difference]: With dead ends: 3713 [2020-09-24 15:00:52,691 INFO L226 Difference]: Without dead ends: 2114 [2020-09-24 15:00:52,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-09-24 15:00:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-09-24 15:00:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2043. [2020-09-24 15:00:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2020-09-24 15:00:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2538 transitions. [2020-09-24 15:00:52,799 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2538 transitions. Word has length 137 [2020-09-24 15:00:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:52,800 INFO L479 AbstractCegarLoop]: Abstraction has 2043 states and 2538 transitions. [2020-09-24 15:00:52,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:00:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2538 transitions. [2020-09-24 15:00:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-24 15:00:52,807 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:52,808 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-24 15:00:52,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:00:52,808 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 281598029, now seen corresponding path program 1 times [2020-09-24 15:00:52,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:52,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107319193] [2020-09-24 15:00:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-24 15:00:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:53,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107319193] [2020-09-24 15:00:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:53,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:00:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490034346] [2020-09-24 15:00:53,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:00:53,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:00:53,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:53,062 INFO L87 Difference]: Start difference. First operand 2043 states and 2538 transitions. Second operand 7 states. [2020-09-24 15:00:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:55,614 INFO L93 Difference]: Finished difference Result 4576 states and 5718 transitions. [2020-09-24 15:00:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:00:55,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-09-24 15:00:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:55,643 INFO L225 Difference]: With dead ends: 4576 [2020-09-24 15:00:55,644 INFO L226 Difference]: Without dead ends: 2343 [2020-09-24 15:00:55,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-09-24 15:00:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2020-09-24 15:00:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2151. [2020-09-24 15:00:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2020-09-24 15:00:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2601 transitions. [2020-09-24 15:00:55,763 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2601 transitions. Word has length 158 [2020-09-24 15:00:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:55,763 INFO L479 AbstractCegarLoop]: Abstraction has 2151 states and 2601 transitions. [2020-09-24 15:00:55,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:00:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2601 transitions. [2020-09-24 15:00:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-09-24 15:00:55,771 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:55,772 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-24 15:00:55,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:00:55,772 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1490542447, now seen corresponding path program 1 times [2020-09-24 15:00:55,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:55,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1056747055] [2020-09-24 15:00:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:55,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:55,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:56,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-24 15:00:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:56,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1056747055] [2020-09-24 15:00:56,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:56,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:00:56,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009162345] [2020-09-24 15:00:56,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:00:56,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:00:56,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:00:56,134 INFO L87 Difference]: Start difference. First operand 2151 states and 2601 transitions. Second operand 8 states. [2020-09-24 15:00:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:59,025 INFO L93 Difference]: Finished difference Result 5214 states and 6499 transitions. [2020-09-24 15:00:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-24 15:00:59,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2020-09-24 15:00:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:59,041 INFO L225 Difference]: With dead ends: 5214 [2020-09-24 15:00:59,041 INFO L226 Difference]: Without dead ends: 3087 [2020-09-24 15:00:59,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-09-24 15:00:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2020-09-24 15:00:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2460. [2020-09-24 15:00:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2460 states. [2020-09-24 15:00:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 2895 transitions. [2020-09-24 15:00:59,127 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 2895 transitions. Word has length 166 [2020-09-24 15:00:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:59,128 INFO L479 AbstractCegarLoop]: Abstraction has 2460 states and 2895 transitions. [2020-09-24 15:00:59,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:00:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 2895 transitions. [2020-09-24 15:00:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-09-24 15:00:59,136 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:59,137 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:59,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:00:59,137 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2063604262, now seen corresponding path program 1 times [2020-09-24 15:00:59,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:59,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512827636] [2020-09-24 15:00:59,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-24 15:00:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:59,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512827636] [2020-09-24 15:00:59,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:59,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:00:59,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433144551] [2020-09-24 15:00:59,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:00:59,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:00:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:00:59,456 INFO L87 Difference]: Start difference. First operand 2460 states and 2895 transitions. Second operand 8 states. [2020-09-24 15:01:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:02,591 INFO L93 Difference]: Finished difference Result 5405 states and 6383 transitions. [2020-09-24 15:01:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-24 15:01:02,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 204 [2020-09-24 15:01:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:02,607 INFO L225 Difference]: With dead ends: 5405 [2020-09-24 15:01:02,607 INFO L226 Difference]: Without dead ends: 2758 [2020-09-24 15:01:02,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-09-24 15:01:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2020-09-24 15:01:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2694. [2020-09-24 15:01:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2694 states. [2020-09-24 15:01:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3078 transitions. [2020-09-24 15:01:02,687 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 3078 transitions. Word has length 204 [2020-09-24 15:01:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:02,687 INFO L479 AbstractCegarLoop]: Abstraction has 2694 states and 3078 transitions. [2020-09-24 15:01:02,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:01:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3078 transitions. [2020-09-24 15:01:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-09-24 15:01:02,695 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:02,695 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2020-09-24 15:01:02,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 15:01:02,696 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash -621031696, now seen corresponding path program 1 times [2020-09-24 15:01:02,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:02,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170170693] [2020-09-24 15:01:02,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-24 15:01:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:01:02,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170170693] [2020-09-24 15:01:02,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:02,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:01:02,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779986329] [2020-09-24 15:01:02,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:01:02,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:01:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:01:02,995 INFO L87 Difference]: Start difference. First operand 2694 states and 3078 transitions. Second operand 7 states. [2020-09-24 15:01:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:04,909 INFO L93 Difference]: Finished difference Result 6074 states and 6931 transitions. [2020-09-24 15:01:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:01:04,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2020-09-24 15:01:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:04,923 INFO L225 Difference]: With dead ends: 6074 [2020-09-24 15:01:04,923 INFO L226 Difference]: Without dead ends: 3404 [2020-09-24 15:01:04,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:01:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2020-09-24 15:01:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3352. [2020-09-24 15:01:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3352 states. [2020-09-24 15:01:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 3713 transitions. [2020-09-24 15:01:05,022 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 3713 transitions. Word has length 217 [2020-09-24 15:01:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:05,022 INFO L479 AbstractCegarLoop]: Abstraction has 3352 states and 3713 transitions. [2020-09-24 15:01:05,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:01:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 3713 transitions. [2020-09-24 15:01:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-09-24 15:01:05,031 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:05,032 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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] [2020-09-24 15:01:05,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-24 15:01:05,032 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1775821608, now seen corresponding path program 1 times [2020-09-24 15:01:05,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:05,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67692799] [2020-09-24 15:01:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-24 15:01:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-24 15:01:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 133 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-09-24 15:01:05,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67692799] [2020-09-24 15:01:05,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:05,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:01:05,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866696809] [2020-09-24 15:01:05,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:01:05,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:01:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:01:05,408 INFO L87 Difference]: Start difference. First operand 3352 states and 3713 transitions. Second operand 5 states. [2020-09-24 15:01:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:07,043 INFO L93 Difference]: Finished difference Result 7171 states and 7976 transitions. [2020-09-24 15:01:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:01:07,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2020-09-24 15:01:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:07,059 INFO L225 Difference]: With dead ends: 7171 [2020-09-24 15:01:07,059 INFO L226 Difference]: Without dead ends: 3843 [2020-09-24 15:01:07,066 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:01:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2020-09-24 15:01:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3642. [2020-09-24 15:01:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2020-09-24 15:01:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4018 transitions. [2020-09-24 15:01:07,147 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4018 transitions. Word has length 249 [2020-09-24 15:01:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:07,147 INFO L479 AbstractCegarLoop]: Abstraction has 3642 states and 4018 transitions. [2020-09-24 15:01:07,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:01:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4018 transitions. [2020-09-24 15:01:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-09-24 15:01:07,158 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:07,158 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-09-24 15:01:07,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-24 15:01:07,159 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -905276433, now seen corresponding path program 1 times [2020-09-24 15:01:07,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:07,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518870925] [2020-09-24 15:01:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:07,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:07,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:07,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-24 15:01:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:07,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-24 15:01:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:07,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-09-24 15:01:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 205 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-09-24 15:01:07,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518870925] [2020-09-24 15:01:07,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:07,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-24 15:01:07,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583207783] [2020-09-24 15:01:07,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-24 15:01:07,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-24 15:01:07,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-24 15:01:07,608 INFO L87 Difference]: Start difference. First operand 3642 states and 4018 transitions. Second operand 11 states. [2020-09-24 15:01:08,258 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-09-24 15:01:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:13,812 INFO L93 Difference]: Finished difference Result 8206 states and 9066 transitions. [2020-09-24 15:01:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-24 15:01:13,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2020-09-24 15:01:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:13,828 INFO L225 Difference]: With dead ends: 8206 [2020-09-24 15:01:13,828 INFO L226 Difference]: Without dead ends: 4128 [2020-09-24 15:01:13,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2020-09-24 15:01:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2020-09-24 15:01:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 3630. [2020-09-24 15:01:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3630 states. [2020-09-24 15:01:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 3976 transitions. [2020-09-24 15:01:13,916 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 3976 transitions. Word has length 279 [2020-09-24 15:01:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:13,916 INFO L479 AbstractCegarLoop]: Abstraction has 3630 states and 3976 transitions. [2020-09-24 15:01:13,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-24 15:01:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 3976 transitions. [2020-09-24 15:01:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2020-09-24 15:01:13,930 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:13,931 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-09-24 15:01:13,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-24 15:01:13,931 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:13,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1238122025, now seen corresponding path program 1 times [2020-09-24 15:01:13,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:13,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987357107] [2020-09-24 15:01:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:01:14,022 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:01:14,023 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:01:14,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-24 15:01:14,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:01:14 BoogieIcfgContainer [2020-09-24 15:01:14,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:01:14,107 INFO L168 Benchmark]: Toolchain (without parser) took 38647.33 ms. Allocated memory was 138.4 MB in the beginning and 618.7 MB in the end (delta: 480.2 MB). Free memory was 99.8 MB in the beginning and 344.7 MB in the end (delta: -244.9 MB). Peak memory consumption was 235.4 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:14,112 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-24 15:01:14,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.38 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 99.2 MB in the beginning and 170.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:14,115 INFO L168 Benchmark]: Boogie Preprocessor took 148.16 ms. Allocated memory is still 203.9 MB. Free memory was 170.1 MB in the beginning and 165.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:14,115 INFO L168 Benchmark]: RCFGBuilder took 1428.61 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 165.0 MB in the beginning and 157.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:14,121 INFO L168 Benchmark]: TraceAbstraction took 36220.74 ms. Allocated memory was 234.9 MB in the beginning and 618.7 MB in the end (delta: 383.8 MB). Free memory was 157.5 MB in the beginning and 344.7 MB in the end (delta: -187.2 MB). Peak memory consumption was 196.6 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:14,129 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.54 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.38 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 99.2 MB in the beginning and 170.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.16 ms. Allocated memory is still 203.9 MB. Free memory was 170.1 MB in the beginning and 165.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1428.61 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 165.0 MB in the beginning and 157.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36220.74 ms. Allocated memory was 234.9 MB in the beginning and 618.7 MB in the end (delta: 383.8 MB). Free memory was 157.5 MB in the beginning and 344.7 MB in the end (delta: -187.2 MB). Peak memory consumption was 196.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 413]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND TRUE ((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L413] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 525 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.0s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3737 SDtfs, 12612 SDslu, 4720 SDs, 0 SdLazy, 16834 SolverSat, 1791 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3642occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2447 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2196 NumberOfCodeBlocks, 2196 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 956296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 837/875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...