/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 --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/Problem02_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 15:31:52,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 15:31:52,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 15:31:52,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 15:31:52,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 15:31:52,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 15:31:52,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 15:31:52,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 15:31:52,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 15:31:52,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 15:31:52,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 15:31:52,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 15:31:52,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 15:31:52,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 15:31:52,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 15:31:52,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 15:31:52,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 15:31:52,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 15:31:52,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 15:31:52,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 15:31:52,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 15:31:52,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 15:31:52,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 15:31:52,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 15:31:52,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 15:31:52,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 15:31:52,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 15:31:52,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 15:31:52,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 15:31:52,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 15:31:52,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 15:31:52,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 15:31:52,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 15:31:52,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 15:31:52,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 15:31:52,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 15:31:52,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 15:31:52,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 15:31:52,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 15:31:52,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 15:31:52,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 15:31:52,914 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-08-18 15:31:52,937 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 15:31:52,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 15:31:52,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 15:31:52,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 15:31:52,939 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 15:31:52,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 15:31:52,939 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 15:31:52,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 15:31:52,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 15:31:52,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 15:31:52,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 15:31:52,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 15:31:52,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 15:31:52,940 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 15:31:52,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 15:31:52,941 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 15:31:52,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 15:31:52,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 15:31:52,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 15:31:52,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 15:31:52,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 15:31:52,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 15:31:52,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 15:31:52,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 15:31:52,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 15:31:52,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 15:31:52,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 15:31:52,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 15:31:52,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 15:31:52,943 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.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-18 15:31:53,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 15:31:53,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 15:31:53,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 15:31:53,243 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 15:31:53,244 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 15:31:53,244 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-08-18 15:31:53,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/474b5bb8e/ffc28e3679424dbf8f97802ec5a01ba7/FLAG7bd9c8242 [2020-08-18 15:31:53,961 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 15:31:53,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-08-18 15:31:53,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/474b5bb8e/ffc28e3679424dbf8f97802ec5a01ba7/FLAG7bd9c8242 [2020-08-18 15:31:54,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/474b5bb8e/ffc28e3679424dbf8f97802ec5a01ba7 [2020-08-18 15:31:54,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 15:31:54,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 15:31:54,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 15:31:54,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 15:31:54,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 15:31:54,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:54,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5783693b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54, skipping insertion in model container [2020-08-18 15:31:54,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:54,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 15:31:54,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 15:31:54,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 15:31:54,657 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 15:31:54,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 15:31:54,972 INFO L208 MainTranslator]: Completed translation [2020-08-18 15:31:54,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54 WrapperNode [2020-08-18 15:31:54,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 15:31:54,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 15:31:54,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 15:31:54,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 15:31:54,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:54,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:55,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:55,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:55,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:55,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:55,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (1/1) ... [2020-08-18 15:31:55,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 15:31:55,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 15:31:55,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 15:31:55,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 15:31:55,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (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-08-18 15:31:55,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 15:31:55,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 15:31:55,192 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-18 15:31:55,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 15:31:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-18 15:31:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 15:31:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 15:31:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-18 15:31:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 15:31:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 15:31:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 15:31:56,453 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 15:31:56,453 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-18 15:31:56,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 03:31:56 BoogieIcfgContainer [2020-08-18 15:31:56,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 15:31:56,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 15:31:56,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 15:31:56,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 15:31:56,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 03:31:54" (1/3) ... [2020-08-18 15:31:56,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc0fd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 03:31:56, skipping insertion in model container [2020-08-18 15:31:56,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 03:31:54" (2/3) ... [2020-08-18 15:31:56,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc0fd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 03:31:56, skipping insertion in model container [2020-08-18 15:31:56,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 03:31:56" (3/3) ... [2020-08-18 15:31:56,469 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2020-08-18 15:31:56,481 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 15:31:56,490 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 15:31:56,507 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 15:31:56,538 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 15:31:56,539 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 15:31:56,539 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 15:31:56,539 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 15:31:56,539 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 15:31:56,540 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 15:31:56,540 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 15:31:56,540 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 15:31:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-08-18 15:31:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-18 15:31:56,581 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:31:56,582 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] [2020-08-18 15:31:56,583 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:31:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:31:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash 389606425, now seen corresponding path program 1 times [2020-08-18 15:31:56,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:31:56,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144015937] [2020-08-18 15:31:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:31:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:31:57,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 15:31:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:31:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 15:31:57,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144015937] [2020-08-18 15:31:57,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 15:31:57,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-18 15:31:57,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371868825] [2020-08-18 15:31:57,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-08-18 15:31:57,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 15:31:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-08-18 15:31:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-08-18 15:31:57,132 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 4 states. [2020-08-18 15:31:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 15:31:58,785 INFO L93 Difference]: Finished difference Result 651 states and 1104 transitions. [2020-08-18 15:31:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 15:31:58,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-08-18 15:31:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 15:31:58,806 INFO L225 Difference]: With dead ends: 651 [2020-08-18 15:31:58,806 INFO L226 Difference]: Without dead ends: 336 [2020-08-18 15:31:58,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-08-18 15:31:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-08-18 15:31:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2020-08-18 15:31:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-18 15:31:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 475 transitions. [2020-08-18 15:31:58,904 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 475 transitions. Word has length 91 [2020-08-18 15:31:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 15:31:58,911 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 475 transitions. [2020-08-18 15:31:58,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-08-18 15:31:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 475 transitions. [2020-08-18 15:31:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-18 15:31:58,923 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:31:58,923 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-18 15:31:58,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 15:31:58,924 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:31:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:31:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1705382370, now seen corresponding path program 1 times [2020-08-18 15:31:58,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:31:58,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [346445693] [2020-08-18 15:31:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:31:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:31:59,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 15:31:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:31:59,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 15:31:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:31:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 15:31:59,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [346445693] [2020-08-18 15:31:59,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 15:31:59,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-18 15:31:59,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964051822] [2020-08-18 15:31:59,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 15:31:59,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 15:31:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 15:31:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 15:31:59,193 INFO L87 Difference]: Start difference. First operand 323 states and 475 transitions. Second operand 8 states. [2020-08-18 15:32:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 15:32:01,510 INFO L93 Difference]: Finished difference Result 1263 states and 1924 transitions. [2020-08-18 15:32:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 15:32:01,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2020-08-18 15:32:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 15:32:01,519 INFO L225 Difference]: With dead ends: 1263 [2020-08-18 15:32:01,519 INFO L226 Difference]: Without dead ends: 946 [2020-08-18 15:32:01,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-08-18 15:32:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2020-08-18 15:32:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 780. [2020-08-18 15:32:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-08-18 15:32:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1063 transitions. [2020-08-18 15:32:01,606 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1063 transitions. Word has length 99 [2020-08-18 15:32:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 15:32:01,607 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 1063 transitions. [2020-08-18 15:32:01,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 15:32:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1063 transitions. [2020-08-18 15:32:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-08-18 15:32:01,615 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:32:01,615 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] [2020-08-18 15:32:01,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 15:32:01,616 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:32:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:32:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1412739102, now seen corresponding path program 1 times [2020-08-18 15:32:01,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:32:01,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583646945] [2020-08-18 15:32:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:32:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:01,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 15:32:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:01,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 15:32:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 15:32:01,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583646945] [2020-08-18 15:32:01,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 15:32:01,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 15:32:01,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452566334] [2020-08-18 15:32:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 15:32:01,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 15:32:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 15:32:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 15:32:01,822 INFO L87 Difference]: Start difference. First operand 780 states and 1063 transitions. Second operand 5 states. [2020-08-18 15:32:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 15:32:03,121 INFO L93 Difference]: Finished difference Result 2305 states and 3257 transitions. [2020-08-18 15:32:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 15:32:03,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2020-08-18 15:32:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 15:32:03,133 INFO L225 Difference]: With dead ends: 2305 [2020-08-18 15:32:03,133 INFO L226 Difference]: Without dead ends: 1531 [2020-08-18 15:32:03,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-18 15:32:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2020-08-18 15:32:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1525. [2020-08-18 15:32:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2020-08-18 15:32:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1978 transitions. [2020-08-18 15:32:03,241 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1978 transitions. Word has length 112 [2020-08-18 15:32:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 15:32:03,241 INFO L479 AbstractCegarLoop]: Abstraction has 1525 states and 1978 transitions. [2020-08-18 15:32:03,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 15:32:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1978 transitions. [2020-08-18 15:32:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-08-18 15:32:03,250 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:32:03,251 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-18 15:32:03,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 15:32:03,251 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:32:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:32:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1624429431, now seen corresponding path program 1 times [2020-08-18 15:32:03,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:32:03,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [418439471] [2020-08-18 15:32:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:32:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:03,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 15:32:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:03,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 15:32:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 15:32:03,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [418439471] [2020-08-18 15:32:03,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 15:32:03,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 15:32:03,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999922034] [2020-08-18 15:32:03,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 15:32:03,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 15:32:03,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 15:32:03,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-18 15:32:03,508 INFO L87 Difference]: Start difference. First operand 1525 states and 1978 transitions. Second operand 8 states. [2020-08-18 15:32:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 15:32:05,667 INFO L93 Difference]: Finished difference Result 4217 states and 5554 transitions. [2020-08-18 15:32:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 15:32:05,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2020-08-18 15:32:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 15:32:05,688 INFO L225 Difference]: With dead ends: 4217 [2020-08-18 15:32:05,688 INFO L226 Difference]: Without dead ends: 1668 [2020-08-18 15:32:05,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-08-18 15:32:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-08-18 15:32:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1662. [2020-08-18 15:32:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2020-08-18 15:32:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2051 transitions. [2020-08-18 15:32:05,784 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2051 transitions. Word has length 117 [2020-08-18 15:32:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 15:32:05,784 INFO L479 AbstractCegarLoop]: Abstraction has 1662 states and 2051 transitions. [2020-08-18 15:32:05,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 15:32:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2051 transitions. [2020-08-18 15:32:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-08-18 15:32:05,790 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:32:05,791 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 15:32:05,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 15:32:05,791 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:32:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:32:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1171867363, now seen corresponding path program 1 times [2020-08-18 15:32:05,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:32:05,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082293419] [2020-08-18 15:32:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:32:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:05,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 15:32:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:05,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 15:32:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:05,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-18 15:32:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 15:32:05,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082293419] [2020-08-18 15:32:05,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 15:32:05,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 15:32:05,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14262349] [2020-08-18 15:32:05,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 15:32:05,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 15:32:05,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 15:32:05,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 15:32:05,991 INFO L87 Difference]: Start difference. First operand 1662 states and 2051 transitions. Second operand 7 states. [2020-08-18 15:32:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 15:32:07,256 INFO L93 Difference]: Finished difference Result 3378 states and 4326 transitions. [2020-08-18 15:32:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 15:32:07,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2020-08-18 15:32:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 15:32:07,267 INFO L225 Difference]: With dead ends: 3378 [2020-08-18 15:32:07,267 INFO L226 Difference]: Without dead ends: 1722 [2020-08-18 15:32:07,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-18 15:32:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-08-18 15:32:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1388. [2020-08-18 15:32:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2020-08-18 15:32:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1617 transitions. [2020-08-18 15:32:07,327 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1617 transitions. Word has length 120 [2020-08-18 15:32:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 15:32:07,327 INFO L479 AbstractCegarLoop]: Abstraction has 1388 states and 1617 transitions. [2020-08-18 15:32:07,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 15:32:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1617 transitions. [2020-08-18 15:32:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-08-18 15:32:07,332 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:32:07,333 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 15:32:07,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 15:32:07,334 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:32:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:32:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1300144537, now seen corresponding path program 1 times [2020-08-18 15:32:07,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:32:07,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982126338] [2020-08-18 15:32:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:32:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:07,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 15:32:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:07,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 15:32:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 15:32:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 15:32:07,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982126338] [2020-08-18 15:32:07,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 15:32:07,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 15:32:07,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858462988] [2020-08-18 15:32:07,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 15:32:07,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 15:32:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 15:32:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 15:32:07,541 INFO L87 Difference]: Start difference. First operand 1388 states and 1617 transitions. Second operand 5 states. [2020-08-18 15:32:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 15:32:08,593 INFO L93 Difference]: Finished difference Result 3508 states and 4213 transitions. [2020-08-18 15:32:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 15:32:08,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-08-18 15:32:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 15:32:08,613 INFO L225 Difference]: With dead ends: 3508 [2020-08-18 15:32:08,614 INFO L226 Difference]: Without dead ends: 2126 [2020-08-18 15:32:08,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-18 15:32:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2020-08-18 15:32:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1830. [2020-08-18 15:32:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1830 states. [2020-08-18 15:32:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2171 transitions. [2020-08-18 15:32:08,675 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2171 transitions. Word has length 125 [2020-08-18 15:32:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 15:32:08,677 INFO L479 AbstractCegarLoop]: Abstraction has 1830 states and 2171 transitions. [2020-08-18 15:32:08,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 15:32:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2171 transitions. [2020-08-18 15:32:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-18 15:32:08,682 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 15:32:08,683 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-18 15:32:08,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 15:32:08,683 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 15:32:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 15:32:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1079124894, now seen corresponding path program 1 times [2020-08-18 15:32:08,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 15:32:08,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524442679] [2020-08-18 15:32:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 15:32:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 15:32:08,728 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 15:32:08,728 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 15:32:08,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 15:32:08,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 03:32:08 BoogieIcfgContainer [2020-08-18 15:32:08,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 15:32:08,785 INFO L168 Benchmark]: Toolchain (without parser) took 14628.29 ms. Allocated memory was 140.0 MB in the beginning and 412.6 MB in the end (delta: 272.6 MB). Free memory was 101.6 MB in the beginning and 146.1 MB in the end (delta: -44.5 MB). Peak memory consumption was 228.1 MB. Max. memory is 7.1 GB. [2020-08-18 15:32:08,786 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 15:32:08,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.85 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 171.9 MB in the end (delta: -70.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2020-08-18 15:32:08,794 INFO L168 Benchmark]: Boogie Preprocessor took 130.73 ms. Allocated memory is still 205.0 MB. Free memory was 171.9 MB in the beginning and 167.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-08-18 15:32:08,795 INFO L168 Benchmark]: RCFGBuilder took 1353.83 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 167.1 MB in the beginning and 182.9 MB in the end (delta: -15.8 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2020-08-18 15:32:08,796 INFO L168 Benchmark]: TraceAbstraction took 12320.40 ms. Allocated memory was 238.6 MB in the beginning and 412.6 MB in the end (delta: 174.1 MB). Free memory was 182.9 MB in the beginning and 146.1 MB in the end (delta: 36.8 MB). Peak memory consumption was 210.9 MB. Max. memory is 7.1 GB. [2020-08-18 15:32:08,808 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.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.85 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 171.9 MB in the end (delta: -70.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.73 ms. Allocated memory is still 205.0 MB. Free memory was 171.9 MB in the beginning and 167.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1353.83 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 167.1 MB in the beginning and 182.9 MB in the end (delta: -15.8 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12320.40 ms. Allocated memory was 238.6 MB in the beginning and 412.6 MB in the end (delta: 174.1 MB). Free memory was 182.9 MB in the beginning and 146.1 MB in the end (delta: 36.8 MB). Peak memory consumption was 210.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 427]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] return 26; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L31] a28 = 9 [L32] a11 = 1 [L33] a25 = 1 [L34] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) [L427] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.2s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 247 SDtfs, 3327 SDslu, 341 SDs, 0 SdLazy, 5495 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1830occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 821 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 247616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 97/105 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...