/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 -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-3af5e1f [2020-09-04 13:36:51,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:36:51,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:36:51,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:36:51,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:36:51,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:36:51,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:36:51,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:36:51,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:36:51,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:36:51,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:36:51,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:36:51,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:36:51,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:36:51,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:36:51,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:36:51,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:36:51,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:36:51,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:36:51,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:36:51,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:36:51,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:36:51,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:36:51,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:36:51,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:36:51,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:36:51,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:36:51,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:36:51,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:36:51,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:36:51,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:36:51,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:36:51,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:36:51,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:36:51,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:36:51,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:36:51,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:36:51,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:36:51,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:36:51,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:36:51,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:36:51,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:36:52,013 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:36:52,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:36:52,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:36:52,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:36:52,017 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:36:52,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:36:52,018 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:36:52,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:36:52,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:36:52,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:36:52,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:36:52,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:36:52,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:36:52,023 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:36:52,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:36:52,023 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:36:52,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:36:52,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:36:52,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:36:52,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:36:52,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:36:52,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:36:52,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:36:52,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:36:52,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:36:52,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:36:52,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:36:52,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:36:52,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:36:52,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:36:52,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:36:52,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:36:52,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:36:52,527 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:36:52,527 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:36:52,529 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-09-04 13:36:52,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2ebecd7f8/2b9c925614604cf5bd3f01ccb6a00f84/FLAG45e287822 [2020-09-04 13:36:53,260 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:36:53,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-09-04 13:36:53,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2ebecd7f8/2b9c925614604cf5bd3f01ccb6a00f84/FLAG45e287822 [2020-09-04 13:36:53,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2ebecd7f8/2b9c925614604cf5bd3f01ccb6a00f84 [2020-09-04 13:36:53,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:36:53,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:36:53,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:36:53,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:36:53,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:36:53,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:36:53" (1/1) ... [2020-09-04 13:36:53,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f7f464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:53, skipping insertion in model container [2020-09-04 13:36:53,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:36:53" (1/1) ... [2020-09-04 13:36:53,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:36:53,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:36:54,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:36:54,209 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:36:54,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:36:54,321 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:36:54,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54 WrapperNode [2020-09-04 13:36:54,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:36:54,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:36:54,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:36:54,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:36:54,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (1/1) ... [2020-09-04 13:36:54,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:36:54,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:36:54,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:36:54,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:36:54,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36: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-09-04 13:36:54,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:36:54,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:36:54,507 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-04 13:36:54,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:36:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-04 13:36:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:36:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:36:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 13:36:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:36:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:36:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:36:55,696 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:36:55,697 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:36:55,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:36:55 BoogieIcfgContainer [2020-09-04 13:36:55,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:36:55,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:36:55,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:36:55,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:36:55,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:36:53" (1/3) ... [2020-09-04 13:36:55,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77648cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:36:55, skipping insertion in model container [2020-09-04 13:36:55,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:36:54" (2/3) ... [2020-09-04 13:36:55,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77648cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:36:55, skipping insertion in model container [2020-09-04 13:36:55,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:36:55" (3/3) ... [2020-09-04 13:36:55,722 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2020-09-04 13:36:55,733 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:36:55,746 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:36:55,769 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:36:55,805 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:36:55,805 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:36:55,805 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:36:55,805 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:36:55,806 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:36:55,806 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:36:55,806 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:36:55,806 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:36:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-09-04 13:36:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 13:36:55,843 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:36:55,844 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-09-04 13:36:55,844 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:36:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:36:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 389606425, now seen corresponding path program 1 times [2020-09-04 13:36:55,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:36:55,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588612678] [2020-09-04 13:36:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:36:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:56,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:36:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:36:56,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588612678] [2020-09-04 13:36:56,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:36:56,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:36:56,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617734899] [2020-09-04 13:36:56,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:36:56,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:36:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:36:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:36:56,468 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 4 states. [2020-09-04 13:36:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:36:58,126 INFO L93 Difference]: Finished difference Result 651 states and 1104 transitions. [2020-09-04 13:36:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:36:58,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-09-04 13:36:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:36:58,164 INFO L225 Difference]: With dead ends: 651 [2020-09-04 13:36:58,164 INFO L226 Difference]: Without dead ends: 336 [2020-09-04 13:36:58,176 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-09-04 13:36:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-09-04 13:36:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2020-09-04 13:36:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 13:36:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 475 transitions. [2020-09-04 13:36:58,268 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 475 transitions. Word has length 91 [2020-09-04 13:36:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:36:58,269 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 475 transitions. [2020-09-04 13:36:58,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:36:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 475 transitions. [2020-09-04 13:36:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 13:36:58,275 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:36:58,276 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-09-04 13:36:58,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:36:58,276 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:36:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:36:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1705382370, now seen corresponding path program 1 times [2020-09-04 13:36:58,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:36:58,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670128768] [2020-09-04 13:36:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:36:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:58,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:36:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:58,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:36:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:36:58,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670128768] [2020-09-04 13:36:58,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:36:58,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:36:58,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240143657] [2020-09-04 13:36:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:36:58,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:36:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:36:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:36:58,551 INFO L87 Difference]: Start difference. First operand 323 states and 475 transitions. Second operand 8 states. [2020-09-04 13:37:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:37:01,054 INFO L93 Difference]: Finished difference Result 1263 states and 1924 transitions. [2020-09-04 13:37:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:37:01,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2020-09-04 13:37:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:37:01,064 INFO L225 Difference]: With dead ends: 1263 [2020-09-04 13:37:01,064 INFO L226 Difference]: Without dead ends: 946 [2020-09-04 13:37:01,066 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-09-04 13:37:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2020-09-04 13:37:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 780. [2020-09-04 13:37:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-09-04 13:37:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1063 transitions. [2020-09-04 13:37:01,124 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1063 transitions. Word has length 99 [2020-09-04 13:37:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:37:01,125 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 1063 transitions. [2020-09-04 13:37:01,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:37:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1063 transitions. [2020-09-04 13:37:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 13:37:01,132 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:37:01,132 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-09-04 13:37:01,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:37:01,133 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:37:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:37:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1412739102, now seen corresponding path program 1 times [2020-09-04 13:37:01,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:37:01,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758314434] [2020-09-04 13:37:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:37:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:01,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:37:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:01,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:37:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:37:01,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758314434] [2020-09-04 13:37:01,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635486636] [2020-09-04 13:37:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:01,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:37:01,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:37:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 13:37:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:37:01,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-09-04 13:37:01,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521967272] [2020-09-04 13:37:01,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:37:01,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:37:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:37:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:37:01,714 INFO L87 Difference]: Start difference. First operand 780 states and 1063 transitions. Second operand 7 states. [2020-09-04 13:37:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:37:04,051 INFO L93 Difference]: Finished difference Result 3856 states and 5799 transitions. [2020-09-04 13:37:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:37:04,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2020-09-04 13:37:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:37:04,086 INFO L225 Difference]: With dead ends: 3856 [2020-09-04 13:37:04,087 INFO L226 Difference]: Without dead ends: 3082 [2020-09-04 13:37:04,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:37:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2020-09-04 13:37:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3040. [2020-09-04 13:37:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2020-09-04 13:37:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 3962 transitions. [2020-09-04 13:37:04,255 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 3962 transitions. Word has length 112 [2020-09-04 13:37:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:37:04,256 INFO L479 AbstractCegarLoop]: Abstraction has 3040 states and 3962 transitions. [2020-09-04 13:37:04,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:37:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3962 transitions. [2020-09-04 13:37:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 13:37:04,266 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:37:04,267 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-09-04 13:37:04,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-04 13:37:04,481 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:37:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:37:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1624429431, now seen corresponding path program 1 times [2020-09-04 13:37:04,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:37:04,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844137610] [2020-09-04 13:37:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:37:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:04,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:37:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:04,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:37:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:37:04,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844137610] [2020-09-04 13:37:04,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681412047] [2020-09-04 13:37:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:04,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-04 13:37:04,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:37:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:37:04,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:37:04,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-09-04 13:37:04,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335607014] [2020-09-04 13:37:04,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:37:04,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:37:04,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:37:04,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:37:04,886 INFO L87 Difference]: Start difference. First operand 3040 states and 3962 transitions. Second operand 3 states. [2020-09-04 13:37:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:37:05,555 INFO L93 Difference]: Finished difference Result 6520 states and 8609 transitions. [2020-09-04 13:37:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:37:05,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-09-04 13:37:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:37:05,576 INFO L225 Difference]: With dead ends: 6520 [2020-09-04 13:37:05,577 INFO L226 Difference]: Without dead ends: 3486 [2020-09-04 13:37:05,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:37:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2020-09-04 13:37:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3480. [2020-09-04 13:37:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3480 states. [2020-09-04 13:37:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4473 transitions. [2020-09-04 13:37:05,697 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4473 transitions. Word has length 117 [2020-09-04 13:37:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:37:05,699 INFO L479 AbstractCegarLoop]: Abstraction has 3480 states and 4473 transitions. [2020-09-04 13:37:05,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:37:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4473 transitions. [2020-09-04 13:37:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 13:37:05,708 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:37:05,708 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:37:05,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:05,923 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:37:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:37:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -789479769, now seen corresponding path program 1 times [2020-09-04 13:37:05,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:37:05,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590102514] [2020-09-04 13:37:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:37:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:06,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:37:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:06,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:37:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:06,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:37:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:37:06,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590102514] [2020-09-04 13:37:06,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407612351] [2020-09-04 13:37:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:06,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-04 13:37:06,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:37:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:37:06,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:37:06,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2020-09-04 13:37:06,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205368219] [2020-09-04 13:37:06,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:37:06,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:37:06,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:37:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:37:06,392 INFO L87 Difference]: Start difference. First operand 3480 states and 4473 transitions. Second operand 12 states. [2020-09-04 13:37:07,897 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-09-04 13:37:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:37:08,997 INFO L93 Difference]: Finished difference Result 7436 states and 9874 transitions. [2020-09-04 13:37:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:37:08,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2020-09-04 13:37:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:37:09,018 INFO L225 Difference]: With dead ends: 7436 [2020-09-04 13:37:09,019 INFO L226 Difference]: Without dead ends: 3962 [2020-09-04 13:37:09,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2020-09-04 13:37:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-09-04 13:37:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3790. [2020-09-04 13:37:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2020-09-04 13:37:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4802 transitions. [2020-09-04 13:37:09,151 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 4802 transitions. Word has length 123 [2020-09-04 13:37:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:37:09,151 INFO L479 AbstractCegarLoop]: Abstraction has 3790 states and 4802 transitions. [2020-09-04 13:37:09,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:37:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4802 transitions. [2020-09-04 13:37:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 13:37:09,160 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:37:09,160 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:37:09,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:09,375 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:37:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:37:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 905961192, now seen corresponding path program 1 times [2020-09-04 13:37:09,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:37:09,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080511510] [2020-09-04 13:37:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:37:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:09,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:37:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:09,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:37:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:09,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:37:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:09,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:37:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-04 13:37:09,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080511510] [2020-09-04 13:37:09,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117758898] [2020-09-04 13:37:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:09,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:37:09,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:37:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 13:37:09,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:37:09,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-09-04 13:37:09,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248132326] [2020-09-04 13:37:09,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:37:09,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:37:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:37:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:37:09,755 INFO L87 Difference]: Start difference. First operand 3790 states and 4802 transitions. Second operand 5 states. [2020-09-04 13:37:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:37:10,610 INFO L93 Difference]: Finished difference Result 9531 states and 12257 transitions. [2020-09-04 13:37:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:37:10,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2020-09-04 13:37:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:37:10,641 INFO L225 Difference]: With dead ends: 9531 [2020-09-04 13:37:10,641 INFO L226 Difference]: Without dead ends: 5747 [2020-09-04 13:37:10,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:37:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2020-09-04 13:37:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5279. [2020-09-04 13:37:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5279 states. [2020-09-04 13:37:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 6754 transitions. [2020-09-04 13:37:10,804 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 6754 transitions. Word has length 128 [2020-09-04 13:37:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:37:10,804 INFO L479 AbstractCegarLoop]: Abstraction has 5279 states and 6754 transitions. [2020-09-04 13:37:10,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:37:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 6754 transitions. [2020-09-04 13:37:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-09-04 13:37:10,816 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:37:10,816 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:37:11,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:11,030 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:37:11,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:37:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash -609590928, now seen corresponding path program 1 times [2020-09-04 13:37:11,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:37:11,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885084267] [2020-09-04 13:37:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:37:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:11,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:37:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:11,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:37:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:11,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:37:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:11,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:37:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-04 13:37:11,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885084267] [2020-09-04 13:37:11,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479018629] [2020-09-04 13:37:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:37:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:37:11,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-04 13:37:11,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:37:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 13:37:11,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:37:11,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2020-09-04 13:37:11,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482401623] [2020-09-04 13:37:11,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:37:11,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:37:11,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:37:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:37:11,436 INFO L87 Difference]: Start difference. First operand 5279 states and 6754 transitions. Second operand 10 states. [2020-09-04 13:37:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:37:14,378 INFO L93 Difference]: Finished difference Result 10786 states and 15605 transitions. [2020-09-04 13:37:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 13:37:14,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2020-09-04 13:37:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:37:14,462 INFO L225 Difference]: With dead ends: 10786 [2020-09-04 13:37:14,462 INFO L226 Difference]: Without dead ends: 5657 [2020-09-04 13:37:14,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2020-09-04 13:37:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2020-09-04 13:37:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 5281. [2020-09-04 13:37:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5281 states. [2020-09-04 13:37:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5281 states to 5281 states and 6131 transitions. [2020-09-04 13:37:14,631 INFO L78 Accepts]: Start accepts. Automaton has 5281 states and 6131 transitions. Word has length 132 [2020-09-04 13:37:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:37:14,632 INFO L479 AbstractCegarLoop]: Abstraction has 5281 states and 6131 transitions. [2020-09-04 13:37:14,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:37:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5281 states and 6131 transitions. [2020-09-04 13:37:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 13:37:14,644 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:37:14,644 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-09-04 13:37:14,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:37:14,858 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:37:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:37:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1079124894, now seen corresponding path program 1 times [2020-09-04 13:37:14,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:37:14,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680033935] [2020-09-04 13:37:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:37:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:37:14,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:37:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:37:14,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:37:15,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:37:15,006 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:37:15,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:37:15,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:37:15 BoogieIcfgContainer [2020-09-04 13:37:15,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:37:15,160 INFO L168 Benchmark]: Toolchain (without parser) took 21618.84 ms. Allocated memory was 140.5 MB in the beginning and 503.3 MB in the end (delta: 362.8 MB). Free memory was 101.7 MB in the beginning and 356.9 MB in the end (delta: -255.2 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:37:15,161 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:37:15,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.13 ms. Allocated memory was 140.5 MB in the beginning and 206.0 MB in the end (delta: 65.5 MB). Free memory was 101.5 MB in the beginning and 172.6 MB in the end (delta: -71.1 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:37:15,162 INFO L168 Benchmark]: Boogie Preprocessor took 117.88 ms. Allocated memory is still 206.0 MB. Free memory was 172.6 MB in the beginning and 167.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:37:15,163 INFO L168 Benchmark]: RCFGBuilder took 1267.75 ms. Allocated memory was 206.0 MB in the beginning and 238.6 MB in the end (delta: 32.5 MB). Free memory was 167.2 MB in the beginning and 180.6 MB in the end (delta: -13.3 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:37:15,164 INFO L168 Benchmark]: TraceAbstraction took 19445.96 ms. Allocated memory was 238.6 MB in the beginning and 503.3 MB in the end (delta: 264.8 MB). Free memory was 180.6 MB in the beginning and 356.9 MB in the end (delta: -176.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:37:15,168 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.13 ms. Allocated memory was 140.5 MB in the beginning and 206.0 MB in the end (delta: 65.5 MB). Free memory was 101.5 MB in the beginning and 172.6 MB in the end (delta: -71.1 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.88 ms. Allocated memory is still 206.0 MB. Free memory was 172.6 MB in the beginning and 167.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1267.75 ms. Allocated memory was 206.0 MB in the beginning and 238.6 MB in the end (delta: 32.5 MB). Free memory was 167.2 MB in the beginning and 180.6 MB in the end (delta: -13.3 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19445.96 ms. Allocated memory was 238.6 MB in the beginning and 503.3 MB in the end (delta: 264.8 MB). Free memory was 180.6 MB in the beginning and 356.9 MB in the end (delta: -176.4 MB). Peak memory consumption was 88.4 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; VAL [\old(a)=38, \old(a11)=42, \old(a17)=29, \old(a19)=30, \old(a21)=33, \old(a25)=35, \old(a28)=43, \old(c)=31, \old(d)=37, \old(e)=28, \old(f)=36, \old(u)=40, \old(v)=27, \old(w)=39, \old(x)=32, \old(y)=41, \old(z)=34, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [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; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L427] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.2s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 396 SDtfs, 4978 SDslu, 538 SDs, 0 SdLazy, 6913 SolverSat, 1529 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5281occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 1243 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1547 NumberOfCodeBlocks, 1547 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1402 ConstructedInterpolants, 0 QuantifiedInterpolants, 401737 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1864 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 332/373 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...