/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 SequenceOfStatements --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.2 --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 20:53:46,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 20:53:46,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 20:53:46,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 20:53:46,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 20:53:46,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 20:53:46,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 20:53:46,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 20:53:46,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 20:53:46,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 20:53:46,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 20:53:46,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 20:53:46,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 20:53:46,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 20:53:46,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 20:53:46,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 20:53:46,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 20:53:46,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 20:53:46,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 20:53:46,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 20:53:46,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 20:53:46,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 20:53:46,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 20:53:46,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 20:53:46,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 20:53:46,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 20:53:46,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 20:53:46,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 20:53:46,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 20:53:46,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 20:53:46,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 20:53:46,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 20:53:46,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 20:53:46,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 20:53:46,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 20:53:46,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 20:53:46,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 20:53:46,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 20:53:46,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 20:53:46,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 20:53:46,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 20:53:46,990 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-10-14 20:53:47,035 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 20:53:47,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 20:53:47,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 20:53:47,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 20:53:47,038 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 20:53:47,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 20:53:47,038 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 20:53:47,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 20:53:47,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 20:53:47,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 20:53:47,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 20:53:47,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 20:53:47,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 20:53:47,041 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 20:53:47,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 20:53:47,042 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 20:53:47,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 20:53:47,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 20:53:47,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 20:53:47,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 20:53:47,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 20:53:47,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 20:53:47,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 20:53:47,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 20:53:47,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 20:53:47,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 20:53:47,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 20:53:47,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 20:53:47,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 20:53:47,044 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 -> SequenceOfStatements Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; [2020-10-14 20:53:47,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 20:53:47,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 20:53:47,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 20:53:47,362 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 20:53:47,363 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 20:53:47,363 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-10-14 20:53:47,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/109e6938b/ca2e74642d2c4169964c6f520d05622d/FLAG49651a1d5 [2020-10-14 20:53:47,976 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 20:53:47,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-10-14 20:53:47,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/109e6938b/ca2e74642d2c4169964c6f520d05622d/FLAG49651a1d5 [2020-10-14 20:53:48,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/109e6938b/ca2e74642d2c4169964c6f520d05622d [2020-10-14 20:53:48,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 20:53:48,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 20:53:48,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 20:53:48,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 20:53:48,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 20:53:48,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4076c4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48, skipping insertion in model container [2020-10-14 20:53:48,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 20:53:48,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 20:53:48,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:53:48,723 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 20:53:48,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:53:48,972 INFO L208 MainTranslator]: Completed translation [2020-10-14 20:53:48,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48 WrapperNode [2020-10-14 20:53:48,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 20:53:48,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 20:53:48,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 20:53:48,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 20:53:48,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:49,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:49,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:49,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:49,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:49,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:49,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 20:53:49,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 20:53:49,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 20:53:49,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 20:53:49,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (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-10-14 20:53:49,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 20:53:49,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 20:53:49,151 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 20:53:49,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 20:53:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 20:53:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 20:53:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 20:53:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 20:53:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 20:53:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 20:53:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 20:53:50,406 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 20:53:50,406 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 20:53:50,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:53:50 BoogieIcfgContainer [2020-10-14 20:53:50,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 20:53:50,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 20:53:50,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 20:53:50,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 20:53:50,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:53:48" (1/3) ... [2020-10-14 20:53:50,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a72e60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:53:50, skipping insertion in model container [2020-10-14 20:53:50,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (2/3) ... [2020-10-14 20:53:50,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a72e60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:53:50, skipping insertion in model container [2020-10-14 20:53:50,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:53:50" (3/3) ... [2020-10-14 20:53:50,422 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-10-14 20:53:50,433 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 20:53:50,441 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 20:53:50,455 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 20:53:50,481 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 20:53:50,481 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 20:53:50,481 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 20:53:50,482 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 20:53:50,482 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 20:53:50,482 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 20:53:50,482 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 20:53:50,482 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 20:53:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 20:53:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-14 20:53:50,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:50,514 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] [2020-10-14 20:53:50,515 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -42109674, now seen corresponding path program 1 times [2020-10-14 20:53:50,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:50,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1244422876] [2020-10-14 20:53:50,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:50,699 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:51,015 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:51,016 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 31 [2020-10-14 20:53:51,016 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:51,016 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 353 [2020-10-14 20:53:51,018 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:51,019 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:51,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:53:51,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:51,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-14 20:53:51,020 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 20:53:51,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:51,116 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:51,123 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:51,124 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:51,124 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:51,124 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-14 20:53:51,124 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:51,125 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:51,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:51,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:51,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:51,126 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:53:51,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1244422876] [2020-10-14 20:53:51,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:53:51,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-14 20:53:51,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144903350] [2020-10-14 20:53:51,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-14 20:53:51,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-14 20:53:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-14 20:53:51,170 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-14 20:53:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:52,571 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-14 20:53:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:53:52,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-14 20:53:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:52,591 INFO L225 Difference]: With dead ends: 581 [2020-10-14 20:53:52,591 INFO L226 Difference]: Without dead ends: 302 [2020-10-14 20:53:52,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:53:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-14 20:53:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-14 20:53:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-14 20:53:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-10-14 20:53:52,675 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 23 [2020-10-14 20:53:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:52,676 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-10-14 20:53:52,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-14 20:53:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-10-14 20:53:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-14 20:53:52,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:52,681 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-14 20:53:52,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 20:53:52,682 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1869200874, now seen corresponding path program 1 times [2020-10-14 20:53:52,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:52,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523097250] [2020-10-14 20:53:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:52,757 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:52,962 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,445 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,553 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:53,553 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 105 [2020-10-14 20:53:53,554 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:53:53,554 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 819 [2020-10-14 20:53:53,555 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:53,556 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:53,556 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-14 20:53:53,556 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:53,556 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 20:53:53,557 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 20:53:53,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:53,638 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,646 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:53,647 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:53,647 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:53,647 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-14 20:53:53,647 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:53,648 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:53,648 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:53,648 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:53,649 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:53,649 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:53,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:53,703 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,744 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,971 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:53,971 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-14 20:53:53,971 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:53,972 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 280 [2020-10-14 20:53:53,972 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:53,972 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:53,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:53,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:53,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-14 20:53:53,973 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-14 20:53:54,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523097250] [2020-10-14 20:53:54,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:54,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-14 20:53:54,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104774545] [2020-10-14 20:53:54,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:54,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:54,040 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 7 states. [2020-10-14 20:53:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:55,493 INFO L93 Difference]: Finished difference Result 894 states and 1299 transitions. [2020-10-14 20:53:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 20:53:55,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2020-10-14 20:53:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:55,501 INFO L225 Difference]: With dead ends: 894 [2020-10-14 20:53:55,501 INFO L226 Difference]: Without dead ends: 604 [2020-10-14 20:53:55,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:53:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-14 20:53:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 596. [2020-10-14 20:53:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-10-14 20:53:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 830 transitions. [2020-10-14 20:53:55,553 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 830 transitions. Word has length 95 [2020-10-14 20:53:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:55,553 INFO L479 AbstractCegarLoop]: Abstraction has 596 states and 830 transitions. [2020-10-14 20:53:55,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 830 transitions. [2020-10-14 20:53:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-14 20:53:55,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:55,558 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-14 20:53:55,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 20:53:55,559 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1249958265, now seen corresponding path program 1 times [2020-10-14 20:53:55,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:55,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432427814] [2020-10-14 20:53:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:55,613 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:55,789 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:55,789 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 112 [2020-10-14 20:53:55,790 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:55,790 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 196 [2020-10-14 20:53:55,790 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:55,790 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:55,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:55,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:53:55,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-10-14 20:53:55,791 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:55,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:55,857 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:55,860 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:55,860 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:55,861 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:55,861 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 20:53:55,861 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:55,861 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:55,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:55,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:55,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:55,862 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:55,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:55,902 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:55,977 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:55,978 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:53:55,978 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:55,978 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-10-14 20:53:55,979 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:55,979 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:55,980 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:55,980 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:55,981 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:53:55,981 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:53:56,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432427814] [2020-10-14 20:53:56,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:56,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-14 20:53:56,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113283045] [2020-10-14 20:53:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-14 20:53:56,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-14 20:53:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-14 20:53:56,070 INFO L87 Difference]: Start difference. First operand 596 states and 830 transitions. Second operand 6 states. [2020-10-14 20:53:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:59,585 INFO L93 Difference]: Finished difference Result 1766 states and 2517 transitions. [2020-10-14 20:53:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:53:59,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2020-10-14 20:53:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:59,597 INFO L225 Difference]: With dead ends: 1766 [2020-10-14 20:53:59,598 INFO L226 Difference]: Without dead ends: 1176 [2020-10-14 20:53:59,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-10-14 20:53:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1174. [2020-10-14 20:53:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2020-10-14 20:53:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1643 transitions. [2020-10-14 20:53:59,662 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1643 transitions. Word has length 102 [2020-10-14 20:53:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:59,663 INFO L479 AbstractCegarLoop]: Abstraction has 1174 states and 1643 transitions. [2020-10-14 20:53:59,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-14 20:53:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1643 transitions. [2020-10-14 20:53:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-14 20:53:59,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:59,671 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:59,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 20:53:59,672 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash -40864794, now seen corresponding path program 1 times [2020-10-14 20:53:59,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:59,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1172320134] [2020-10-14 20:53:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:59,727 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:00,007 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:00,008 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 145 [2020-10-14 20:54:00,008 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:00,008 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 300 [2020-10-14 20:54:00,008 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:00,009 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:00,009 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:54:00,009 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:54:00,009 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 20:54:00,009 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:00,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:00,067 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:00,071 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:00,072 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:00,072 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:00,072 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-14 20:54:00,072 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:00,073 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:00,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:00,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:00,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:54:00,073 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:00,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:00,127 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:00,275 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:00,275 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-14 20:54:00,275 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:00,275 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 164 [2020-10-14 20:54:00,276 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:00,276 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:00,276 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:00,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:00,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113 [2020-10-14 20:54:00,277 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:54:00,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1172320134] [2020-10-14 20:54:00,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:54:00,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-14 20:54:00,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947632629] [2020-10-14 20:54:00,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:00,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:00,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:00,458 INFO L87 Difference]: Start difference. First operand 1174 states and 1643 transitions. Second operand 7 states. [2020-10-14 20:54:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:02,078 INFO L93 Difference]: Finished difference Result 2233 states and 3211 transitions. [2020-10-14 20:54:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 20:54:02,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2020-10-14 20:54:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:02,086 INFO L225 Difference]: With dead ends: 2233 [2020-10-14 20:54:02,087 INFO L226 Difference]: Without dead ends: 1208 [2020-10-14 20:54:02,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:54:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-10-14 20:54:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1045. [2020-10-14 20:54:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2020-10-14 20:54:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1332 transitions. [2020-10-14 20:54:02,130 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1332 transitions. Word has length 135 [2020-10-14 20:54:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:02,131 INFO L479 AbstractCegarLoop]: Abstraction has 1045 states and 1332 transitions. [2020-10-14 20:54:02,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1332 transitions. [2020-10-14 20:54:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-10-14 20:54:02,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:02,134 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:02,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 20:54:02,135 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1701421403, now seen corresponding path program 1 times [2020-10-14 20:54:02,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:02,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650156141] [2020-10-14 20:54:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:02,196 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:02,418 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,346 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:03,347 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 150 [2020-10-14 20:54:03,347 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:54:03,347 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1174 [2020-10-14 20:54:03,348 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:03,348 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:03,348 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:54:03,348 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:54:03,348 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-14 20:54:03,349 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:03,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:03,404 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,408 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:03,408 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:03,409 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:03,409 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-14 20:54:03,409 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:03,409 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:03,409 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:03,410 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:03,410 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:54:03,410 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:03,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:03,469 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,686 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:03,687 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 20:54:03,687 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:03,687 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 240 [2020-10-14 20:54:03,687 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:03,688 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:03,688 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:03,688 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:03,688 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 20:54:03,689 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:54:03,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650156141] [2020-10-14 20:54:03,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:54:03,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-14 20:54:03,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617041733] [2020-10-14 20:54:03,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:03,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:03,790 INFO L87 Difference]: Start difference. First operand 1045 states and 1332 transitions. Second operand 7 states. [2020-10-14 20:54:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:05,227 INFO L93 Difference]: Finished difference Result 2241 states and 2853 transitions. [2020-10-14 20:54:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 20:54:05,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-10-14 20:54:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:05,235 INFO L225 Difference]: With dead ends: 2241 [2020-10-14 20:54:05,235 INFO L226 Difference]: Without dead ends: 1202 [2020-10-14 20:54:05,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-14 20:54:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-10-14 20:54:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1196. [2020-10-14 20:54:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2020-10-14 20:54:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1508 transitions. [2020-10-14 20:54:05,273 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1508 transitions. Word has length 140 [2020-10-14 20:54:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:05,274 INFO L479 AbstractCegarLoop]: Abstraction has 1196 states and 1508 transitions. [2020-10-14 20:54:05,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1508 transitions. [2020-10-14 20:54:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-10-14 20:54:05,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:05,278 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, 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] [2020-10-14 20:54:05,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 20:54:05,279 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:05,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2040878078, now seen corresponding path program 1 times [2020-10-14 20:54:05,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:05,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938168660] [2020-10-14 20:54:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 20:54:05,322 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 20:54:05,323 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 20:54:05,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 20:54:05,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:54:05 BoogieIcfgContainer [2020-10-14 20:54:05,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 20:54:05,365 INFO L168 Benchmark]: Toolchain (without parser) took 17141.69 ms. Allocated memory was 147.8 MB in the beginning and 433.1 MB in the end (delta: 285.2 MB). Free memory was 101.6 MB in the beginning and 306.8 MB in the end (delta: -205.2 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:05,366 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.7 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-14 20:54:05,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.61 ms. Allocated memory was 147.8 MB in the beginning and 207.1 MB in the end (delta: 59.2 MB). Free memory was 101.2 MB in the beginning and 173.5 MB in the end (delta: -72.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:05,368 INFO L168 Benchmark]: Boogie Preprocessor took 105.96 ms. Allocated memory is still 207.1 MB. Free memory was 173.5 MB in the beginning and 168.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:05,369 INFO L168 Benchmark]: RCFGBuilder took 1333.53 ms. Allocated memory was 207.1 MB in the beginning and 235.4 MB in the end (delta: 28.3 MB). Free memory was 168.5 MB in the beginning and 176.2 MB in the end (delta: -7.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:05,370 INFO L168 Benchmark]: TraceAbstraction took 14947.87 ms. Allocated memory was 235.4 MB in the beginning and 433.1 MB in the end (delta: 197.7 MB). Free memory was 176.2 MB in the beginning and 306.8 MB in the end (delta: -130.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:05,374 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.17 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.7 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.61 ms. Allocated memory was 147.8 MB in the beginning and 207.1 MB in the end (delta: 59.2 MB). Free memory was 101.2 MB in the beginning and 173.5 MB in the end (delta: -72.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.96 ms. Allocated memory is still 207.1 MB. Free memory was 173.5 MB in the beginning and 168.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1333.53 ms. Allocated memory was 207.1 MB in the beginning and 235.4 MB in the end (delta: 28.3 MB). Free memory was 168.5 MB in the beginning and 176.2 MB in the end (delta: -7.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14947.87 ms. Allocated memory was 235.4 MB in the beginning and 433.1 MB in the end (delta: 197.7 MB). Free memory was 176.2 MB in the beginning and 306.8 MB in the end (delta: -130.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 116 SDtfs, 2197 SDslu, 145 SDs, 0 SdLazy, 4075 SolverSat, 586 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1196occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 185 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 164555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 50/64 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...