/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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:00:48,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:00:48,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:00:48,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:00:48,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:00:48,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:00:48,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:00:48,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:00:48,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:00:48,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:00:48,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:00:48,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:00:48,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:00:48,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:00:48,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:00:48,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:00:48,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:00:48,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:00:48,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:00:48,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:00:48,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:00:48,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:00:48,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:00:48,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:00:48,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:00:48,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:00:48,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:00:48,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:00:48,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:00:48,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:00:48,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:00:48,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:00:48,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:00:48,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:00:48,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:00:48,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:00:48,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:00:48,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:00:48,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:00:48,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:00:48,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:00:48,930 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:48,976 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:00:48,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:00:48,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:00:48,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:00:48,978 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:00:48,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:00:48,979 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:00:48,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:00:48,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:00:48,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:00:48,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:00:48,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:00:48,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:00:48,982 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:00:48,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:00:48,982 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:00:48,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:00:48,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:00:48,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:00:48,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:00:48,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:00:48,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:00:48,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:00:48,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:00:48,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:00:48,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:00:48,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:00:48,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:00:48,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:00:48,985 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:49,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:00:49,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:00:49,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:00:49,435 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:00:49,435 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:00:49,436 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-09-24 15:00:49,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/68717203c/f0d4862184f24a219762f6431e056b56/FLAGe6de5acd8 [2020-09-24 15:00:50,196 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:00:50,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-09-24 15:00:50,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/68717203c/f0d4862184f24a219762f6431e056b56/FLAGe6de5acd8 [2020-09-24 15:00:50,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/68717203c/f0d4862184f24a219762f6431e056b56 [2020-09-24 15:00:50,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:00:50,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:00:50,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:00:50,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:00:50,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:00:50,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:00:50" (1/1) ... [2020-09-24 15:00:50,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32662f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:50, skipping insertion in model container [2020-09-24 15:00:50,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:00:50" (1/1) ... [2020-09-24 15:00:50,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:00:50,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:00:51,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:00:51,183 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:00:51,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:00:51,292 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:00:51,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:51 WrapperNode [2020-09-24 15:00:51,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:00:51,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:00:51,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:00:51,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:00:51,310 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:51" (1/1) ... [2020-09-24 15:00:51,310 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:51" (1/1) ... [2020-09-24 15:00:51,330 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:51" (1/1) ... [2020-09-24 15:00:51,330 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:51" (1/1) ... [2020-09-24 15:00:51,374 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:51" (1/1) ... [2020-09-24 15:00:51,391 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:51" (1/1) ... [2020-09-24 15:00:51,399 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:51" (1/1) ... [2020-09-24 15:00:51,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:00:51,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:00:51,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:00:51,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:00:51,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:51" (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:51,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:00:51,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:00:51,514 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:00:51,515 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:00:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:00:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:00:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:00:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:00:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:00:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:00:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:00:52,891 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:00:52,891 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:00:52,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:00:52 BoogieIcfgContainer [2020-09-24 15:00:52,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:00:52,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:00:52,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:00:52,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:00:52,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:00:50" (1/3) ... [2020-09-24 15:00:52,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c59d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:00:52, skipping insertion in model container [2020-09-24 15:00:52,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:51" (2/3) ... [2020-09-24 15:00:52,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c59d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:00:52, skipping insertion in model container [2020-09-24 15:00:52,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:00:52" (3/3) ... [2020-09-24 15:00:52,922 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label56.c [2020-09-24 15:00:52,934 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:00:52,951 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:00:52,970 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:00:52,999 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:00:53,000 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:00:53,000 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:00:53,000 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:00:53,000 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:00:53,000 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:00:53,000 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:00:53,001 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:00:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2020-09-24 15:00:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-24 15:00:53,053 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:53,054 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] [2020-09-24 15:00:53,055 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash 602782831, now seen corresponding path program 1 times [2020-09-24 15:00:53,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:53,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214842850] [2020-09-24 15:00:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:53,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:53,658 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:53,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214842850] [2020-09-24 15:00:53,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:53,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:00:53,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780253091] [2020-09-24 15:00:53,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:53,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:53,697 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 5 states. [2020-09-24 15:00:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:56,577 INFO L93 Difference]: Finished difference Result 1360 states and 1895 transitions. [2020-09-24 15:00:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-24 15:00:56,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2020-09-24 15:00:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:56,609 INFO L225 Difference]: With dead ends: 1360 [2020-09-24 15:00:56,609 INFO L226 Difference]: Without dead ends: 781 [2020-09-24 15:00:56,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-09-24 15:00:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 746. [2020-09-24 15:00:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-09-24 15:00:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 932 transitions. [2020-09-24 15:00:56,749 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 932 transitions. Word has length 104 [2020-09-24 15:00:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:56,750 INFO L479 AbstractCegarLoop]: Abstraction has 746 states and 932 transitions. [2020-09-24 15:00:56,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 932 transitions. [2020-09-24 15:00:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-09-24 15:00:56,774 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:56,774 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] [2020-09-24 15:00:56,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:00:56,775 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 305762680, now seen corresponding path program 1 times [2020-09-24 15:00:56,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:56,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813586664] [2020-09-24 15:00:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:57,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:57,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:57,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813586664] [2020-09-24 15:00:57,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:57,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:00:57,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504531519] [2020-09-24 15:00:57,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:57,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:57,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:57,123 INFO L87 Difference]: Start difference. First operand 746 states and 932 transitions. Second operand 5 states. [2020-09-24 15:00:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:59,222 INFO L93 Difference]: Finished difference Result 1955 states and 2547 transitions. [2020-09-24 15:00:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:00:59,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2020-09-24 15:00:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:59,235 INFO L225 Difference]: With dead ends: 1955 [2020-09-24 15:00:59,235 INFO L226 Difference]: Without dead ends: 1233 [2020-09-24 15:00:59,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 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:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-09-24 15:00:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1034. [2020-09-24 15:00:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2020-09-24 15:00:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1301 transitions. [2020-09-24 15:00:59,299 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1301 transitions. Word has length 134 [2020-09-24 15:00:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:59,300 INFO L479 AbstractCegarLoop]: Abstraction has 1034 states and 1301 transitions. [2020-09-24 15:00:59,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1301 transitions. [2020-09-24 15:00:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-09-24 15:00:59,307 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:59,307 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:59,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:00:59,308 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:59,308 INFO L82 PathProgramCache]: Analyzing trace with hash -588171755, now seen corresponding path program 1 times [2020-09-24 15:00:59,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:59,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681919303] [2020-09-24 15:00:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-24 15:00:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:59,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681919303] [2020-09-24 15:00:59,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:59,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:00:59,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924799599] [2020-09-24 15:00:59,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:00:59,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:00:59,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:59,748 INFO L87 Difference]: Start difference. First operand 1034 states and 1301 transitions. Second operand 7 states. [2020-09-24 15:01:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:02,380 INFO L93 Difference]: Finished difference Result 2796 states and 3651 transitions. [2020-09-24 15:01:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:01:02,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2020-09-24 15:01:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:02,392 INFO L225 Difference]: With dead ends: 2796 [2020-09-24 15:01:02,392 INFO L226 Difference]: Without dead ends: 1786 [2020-09-24 15:01:02,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2020-09-24 15:01:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1699. [2020-09-24 15:01:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2020-09-24 15:01:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2093 transitions. [2020-09-24 15:01:02,466 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2093 transitions. Word has length 181 [2020-09-24 15:01:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:02,466 INFO L479 AbstractCegarLoop]: Abstraction has 1699 states and 2093 transitions. [2020-09-24 15:01:02,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:01:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2093 transitions. [2020-09-24 15:01:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-09-24 15:01:02,477 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:02,477 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:01:02,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:01:02,478 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1738067261, now seen corresponding path program 1 times [2020-09-24 15:01:02,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:02,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704222834] [2020-09-24 15:01:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-24 15:01:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:01:02,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704222834] [2020-09-24 15:01:02,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:02,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:01:02,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260796885] [2020-09-24 15:01:02,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:01:02,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:02,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:01:02,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:01:02,813 INFO L87 Difference]: Start difference. First operand 1699 states and 2093 transitions. Second operand 7 states. [2020-09-24 15:01:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:04,999 INFO L93 Difference]: Finished difference Result 3980 states and 5073 transitions. [2020-09-24 15:01:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:01:04,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2020-09-24 15:01:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:05,014 INFO L225 Difference]: With dead ends: 3980 [2020-09-24 15:01:05,014 INFO L226 Difference]: Without dead ends: 2305 [2020-09-24 15:01:05,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2020-09-24 15:01:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1773. [2020-09-24 15:01:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2020-09-24 15:01:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2136 transitions. [2020-09-24 15:01:05,091 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2136 transitions. Word has length 182 [2020-09-24 15:01:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:05,091 INFO L479 AbstractCegarLoop]: Abstraction has 1773 states and 2136 transitions. [2020-09-24 15:01:05,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:01:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2136 transitions. [2020-09-24 15:01:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-09-24 15:01:05,099 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:05,100 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:01:05,100 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1707194346, now seen corresponding path program 1 times [2020-09-24 15:01:05,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:05,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470551703] [2020-09-24 15:01:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-24 15:01:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-24 15:01:05,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470551703] [2020-09-24 15:01:05,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:05,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:01:05,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205546561] [2020-09-24 15:01:05,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:01:05,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:01:05,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:01:05,462 INFO L87 Difference]: Start difference. First operand 1773 states and 2136 transitions. Second operand 9 states. [2020-09-24 15:01:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:09,524 INFO L93 Difference]: Finished difference Result 5645 states and 6939 transitions. [2020-09-24 15:01:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-24 15:01:09,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2020-09-24 15:01:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:09,543 INFO L225 Difference]: With dead ends: 5645 [2020-09-24 15:01:09,543 INFO L226 Difference]: Without dead ends: 3896 [2020-09-24 15:01:09,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2020-09-24 15:01:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2020-09-24 15:01:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3761. [2020-09-24 15:01:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2020-09-24 15:01:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 4582 transitions. [2020-09-24 15:01:09,670 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 4582 transitions. Word has length 188 [2020-09-24 15:01:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:09,670 INFO L479 AbstractCegarLoop]: Abstraction has 3761 states and 4582 transitions. [2020-09-24 15:01:09,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:01:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 4582 transitions. [2020-09-24 15:01:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-09-24 15:01:09,686 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:09,686 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:01:09,687 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -907335323, now seen corresponding path program 1 times [2020-09-24 15:01:09,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:09,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259722121] [2020-09-24 15:01:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:09,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:09,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:09,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-24 15:01:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:09,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-24 15:01:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 96 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-24 15:01:10,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259722121] [2020-09-24 15:01:10,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:10,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:01:10,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095558250] [2020-09-24 15:01:10,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:01:10,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:10,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:01:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:01:10,039 INFO L87 Difference]: Start difference. First operand 3761 states and 4582 transitions. Second operand 8 states. [2020-09-24 15:01:10,336 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-09-24 15:01:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:13,853 INFO L93 Difference]: Finished difference Result 8645 states and 10579 transitions. [2020-09-24 15:01:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-24 15:01:13,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 209 [2020-09-24 15:01:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:13,875 INFO L225 Difference]: With dead ends: 8645 [2020-09-24 15:01:13,875 INFO L226 Difference]: Without dead ends: 4334 [2020-09-24 15:01:13,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-09-24 15:01:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4334 states. [2020-09-24 15:01:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4334 to 3469. [2020-09-24 15:01:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2020-09-24 15:01:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 3915 transitions. [2020-09-24 15:01:13,985 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 3915 transitions. Word has length 209 [2020-09-24 15:01:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:13,986 INFO L479 AbstractCegarLoop]: Abstraction has 3469 states and 3915 transitions. [2020-09-24 15:01:13,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:01:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 3915 transitions. [2020-09-24 15:01:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-09-24 15:01:13,997 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:13,997 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:01:13,997 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:13,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash -702553439, now seen corresponding path program 1 times [2020-09-24 15:01:13,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:13,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58651193] [2020-09-24 15:01:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:14,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:14,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:14,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-24 15:01:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:14,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-24 15:01:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-09-24 15:01:14,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58651193] [2020-09-24 15:01:14,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:14,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:01:14,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074444947] [2020-09-24 15:01:14,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:01:14,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:01:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:01:14,333 INFO L87 Difference]: Start difference. First operand 3469 states and 3915 transitions. Second operand 8 states. [2020-09-24 15:01:14,861 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-09-24 15:01:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:16,989 INFO L93 Difference]: Finished difference Result 7748 states and 8789 transitions. [2020-09-24 15:01:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-24 15:01:16,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 217 [2020-09-24 15:01:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:17,008 INFO L225 Difference]: With dead ends: 7748 [2020-09-24 15:01:17,009 INFO L226 Difference]: Without dead ends: 4303 [2020-09-24 15:01:17,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-09-24 15:01:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2020-09-24 15:01:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3950. [2020-09-24 15:01:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2020-09-24 15:01:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 4457 transitions. [2020-09-24 15:01:17,128 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 4457 transitions. Word has length 217 [2020-09-24 15:01:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:17,129 INFO L479 AbstractCegarLoop]: Abstraction has 3950 states and 4457 transitions. [2020-09-24 15:01:17,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:01:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 4457 transitions. [2020-09-24 15:01:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-09-24 15:01:17,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:17,145 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-24 15:01:17,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:01:17,145 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1074761024, now seen corresponding path program 1 times [2020-09-24 15:01:17,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:17,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079245012] [2020-09-24 15:01:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:17,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:17,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:17,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-24 15:01:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:17,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-09-24 15:01:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 112 proven. 48 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-09-24 15:01:17,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079245012] [2020-09-24 15:01:17,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:17,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:01:17,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731923244] [2020-09-24 15:01:17,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:01:17,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:01:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:01:17,603 INFO L87 Difference]: Start difference. First operand 3950 states and 4457 transitions. Second operand 8 states. [2020-09-24 15:01:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:19,400 INFO L93 Difference]: Finished difference Result 7931 states and 8959 transitions. [2020-09-24 15:01:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:01:19,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2020-09-24 15:01:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:19,416 INFO L225 Difference]: With dead ends: 7931 [2020-09-24 15:01:19,416 INFO L226 Difference]: Without dead ends: 4005 [2020-09-24 15:01:19,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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:01:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2020-09-24 15:01:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3809. [2020-09-24 15:01:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2020-09-24 15:01:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 4229 transitions. [2020-09-24 15:01:19,519 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 4229 transitions. Word has length 249 [2020-09-24 15:01:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:19,520 INFO L479 AbstractCegarLoop]: Abstraction has 3809 states and 4229 transitions. [2020-09-24 15:01:19,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:01:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 4229 transitions. [2020-09-24 15:01:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2020-09-24 15:01:19,532 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:19,532 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-24 15:01:19,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 15:01:19,533 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1468348462, now seen corresponding path program 1 times [2020-09-24 15:01:19,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:19,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999243973] [2020-09-24 15:01:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:19,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:19,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:19,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-24 15:01:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:19,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-24 15:01:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:19,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-09-24 15:01:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 195 proven. 61 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-09-24 15:01:20,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999243973] [2020-09-24 15:01:20,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:20,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:01:20,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045380177] [2020-09-24 15:01:20,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:01:20,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:01:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:01:20,029 INFO L87 Difference]: Start difference. First operand 3809 states and 4229 transitions. Second operand 9 states. [2020-09-24 15:01:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:24,400 INFO L93 Difference]: Finished difference Result 9701 states and 10906 transitions. [2020-09-24 15:01:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-24 15:01:24,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 292 [2020-09-24 15:01:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:24,425 INFO L225 Difference]: With dead ends: 9701 [2020-09-24 15:01:24,425 INFO L226 Difference]: Without dead ends: 5916 [2020-09-24 15:01:24,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2020-09-24 15:01:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2020-09-24 15:01:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 5832. [2020-09-24 15:01:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5832 states. [2020-09-24 15:01:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5832 states to 5832 states and 6526 transitions. [2020-09-24 15:01:24,593 INFO L78 Accepts]: Start accepts. Automaton has 5832 states and 6526 transitions. Word has length 292 [2020-09-24 15:01:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:24,593 INFO L479 AbstractCegarLoop]: Abstraction has 5832 states and 6526 transitions. [2020-09-24 15:01:24,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:01:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states and 6526 transitions. [2020-09-24 15:01:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2020-09-24 15:01:24,619 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:24,619 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2020-09-24 15:01:24,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-24 15:01:24,620 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:24,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:24,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1010232167, now seen corresponding path program 1 times [2020-09-24 15:01:24,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:24,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052499093] [2020-09-24 15:01:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:24,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:01:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:24,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:01:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:24,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-24 15:01:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:24,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-24 15:01:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:24,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-09-24 15:01:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:01:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 244 proven. 18 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-09-24 15:01:25,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052499093] [2020-09-24 15:01:25,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:01:25,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:01:25,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441001409] [2020-09-24 15:01:25,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:01:25,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:01:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:01:25,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:01:25,094 INFO L87 Difference]: Start difference. First operand 5832 states and 6526 transitions. Second operand 8 states. [2020-09-24 15:01:25,837 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-09-24 15:01:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:27,654 INFO L93 Difference]: Finished difference Result 13153 states and 14872 transitions. [2020-09-24 15:01:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-24 15:01:27,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 321 [2020-09-24 15:01:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:27,715 INFO L225 Difference]: With dead ends: 13153 [2020-09-24 15:01:27,716 INFO L226 Difference]: Without dead ends: 7355 [2020-09-24 15:01:27,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-09-24 15:01:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2020-09-24 15:01:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 7281. [2020-09-24 15:01:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2020-09-24 15:01:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 8199 transitions. [2020-09-24 15:01:27,884 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 8199 transitions. Word has length 321 [2020-09-24 15:01:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:27,884 INFO L479 AbstractCegarLoop]: Abstraction has 7281 states and 8199 transitions. [2020-09-24 15:01:27,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:01:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 8199 transitions. [2020-09-24 15:01:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2020-09-24 15:01:27,911 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:27,912 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-24 15:01:27,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-24 15:01:27,913 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash -880486501, now seen corresponding path program 1 times [2020-09-24 15:01:27,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:27,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [916009053] [2020-09-24 15:01:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:01:28,026 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:01:28,026 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:01:28,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-24 15:01:28,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:01:28 BoogieIcfgContainer [2020-09-24 15:01:28,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:01:28,125 INFO L168 Benchmark]: Toolchain (without parser) took 37655.85 ms. Allocated memory was 141.6 MB in the beginning and 679.5 MB in the end (delta: 537.9 MB). Free memory was 103.4 MB in the beginning and 495.2 MB in the end (delta: -391.8 MB). Peak memory consumption was 146.1 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:28,127 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-24 15:01:28,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.06 ms. Allocated memory was 141.6 MB in the beginning and 206.6 MB in the end (delta: 65.0 MB). Free memory was 102.8 MB in the beginning and 172.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:28,132 INFO L168 Benchmark]: Boogie Preprocessor took 115.16 ms. Allocated memory is still 206.6 MB. Free memory was 172.5 MB in the beginning and 167.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:28,136 INFO L168 Benchmark]: RCFGBuilder took 1500.82 ms. Allocated memory was 206.6 MB in the beginning and 237.5 MB in the end (delta: 30.9 MB). Free memory was 167.8 MB in the beginning and 154.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:28,138 INFO L168 Benchmark]: TraceAbstraction took 35209.66 ms. Allocated memory was 237.5 MB in the beginning and 679.5 MB in the end (delta: 442.0 MB). Free memory was 154.6 MB in the beginning and 495.2 MB in the end (delta: -340.6 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:28,147 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.55 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.06 ms. Allocated memory was 141.6 MB in the beginning and 206.6 MB in the end (delta: 65.0 MB). Free memory was 102.8 MB in the beginning and 172.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.16 ms. Allocated memory is still 206.6 MB. Free memory was 172.5 MB in the beginning and 167.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1500.82 ms. Allocated memory was 206.6 MB in the beginning and 237.5 MB in the end (delta: 30.9 MB). Free memory was 167.8 MB in the beginning and 154.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35209.66 ms. Allocated memory was 237.5 MB in the beginning and 679.5 MB in the end (delta: 442.0 MB). Free memory was 154.6 MB in the beginning and 495.2 MB in the end (delta: -340.6 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 404]: 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 TRUE ((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)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] 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 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 TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] 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 TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L404] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 525 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.0s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3292 SDtfs, 13451 SDslu, 4512 SDs, 0 SdLazy, 15139 SolverSat, 1661 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7281occurred 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: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 2560 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2419 NumberOfCodeBlocks, 2419 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2067 ConstructedInterpolants, 0 QuantifiedInterpolants, 1071507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 1284/1454 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...