/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 01:25:43,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 01:25:43,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 01:25:43,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 01:25:43,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 01:25:43,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 01:25:43,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 01:25:43,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 01:25:43,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 01:25:43,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 01:25:43,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 01:25:43,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 01:25:43,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 01:25:43,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 01:25:43,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 01:25:43,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 01:25:43,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 01:25:43,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 01:25:43,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 01:25:43,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 01:25:43,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 01:25:43,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 01:25:43,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 01:25:43,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 01:25:43,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 01:25:43,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 01:25:43,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 01:25:43,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 01:25:43,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 01:25:43,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 01:25:43,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 01:25:43,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 01:25:43,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 01:25:43,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 01:25:43,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 01:25:43,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 01:25:43,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 01:25:43,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 01:25:43,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 01:25:43,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 01:25:43,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 01:25:43,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 01:25:43,526 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 01:25:43,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 01:25:43,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 01:25:43,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 01:25:43,528 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 01:25:43,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 01:25:43,528 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 01:25:43,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 01:25:43,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 01:25:43,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 01:25:43,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 01:25:43,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 01:25:43,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 01:25:43,531 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 01:25:43,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 01:25:43,531 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 01:25:43,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 01:25:43,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 01:25:43,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 01:25:43,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 01:25:43,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 01:25:43,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 01:25:43,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 01:25:43,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 01:25:43,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 01:25:43,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 01:25:43,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:43,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 01:25:43,534 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 01:25:43,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 01:25:43,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 01:25:43,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 01:25:43,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 01:25:43,827 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 01:25:43,828 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 01:25:43,829 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44.c [2020-07-21 01:25:43,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ecd5850/dcb1bba5d7db44988cbcf28e11cab924/FLAG03b0d8982 [2020-07-21 01:25:44,489 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 01:25:44,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label44.c [2020-07-21 01:25:44,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ecd5850/dcb1bba5d7db44988cbcf28e11cab924/FLAG03b0d8982 [2020-07-21 01:25:44,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ecd5850/dcb1bba5d7db44988cbcf28e11cab924 [2020-07-21 01:25:44,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 01:25:44,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 01:25:44,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 01:25:44,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 01:25:44,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 01:25:44,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:25:44" (1/1) ... [2020-07-21 01:25:44,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f84d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:44, skipping insertion in model container [2020-07-21 01:25:44,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:25:44" (1/1) ... [2020-07-21 01:25:44,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 01:25:44,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 01:25:45,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 01:25:45,400 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 01:25:45,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 01:25:45,509 INFO L208 MainTranslator]: Completed translation [2020-07-21 01:25:45,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45 WrapperNode [2020-07-21 01:25:45,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 01:25:45,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 01:25:45,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 01:25:45,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 01:25:45,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... [2020-07-21 01:25:45,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 01:25:45,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 01:25:45,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 01:25:45,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 01:25:45,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-21 01:25:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 01:25:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 01:25:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-21 01:25:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 01:25:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-21 01:25:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 01:25:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 01:25:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-21 01:25:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 01:25:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 01:25:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 01:25:46,919 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 01:25:46,919 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 01:25:46,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:25:46 BoogieIcfgContainer [2020-07-21 01:25:46,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 01:25:46,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 01:25:46,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 01:25:46,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 01:25:46,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:25:44" (1/3) ... [2020-07-21 01:25:46,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20232f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:25:46, skipping insertion in model container [2020-07-21 01:25:46,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:45" (2/3) ... [2020-07-21 01:25:46,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20232f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:25:46, skipping insertion in model container [2020-07-21 01:25:46,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:25:46" (3/3) ... [2020-07-21 01:25:46,937 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label44.c [2020-07-21 01:25:46,950 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 01:25:46,959 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 01:25:46,978 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 01:25:47,009 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 01:25:47,009 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 01:25:47,010 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 01:25:47,010 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 01:25:47,010 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 01:25:47,011 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 01:25:47,011 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 01:25:47,011 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 01:25:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-07-21 01:25:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-21 01:25:47,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:25:47,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:25:47,054 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:25:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:25:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1767789518, now seen corresponding path program 1 times [2020-07-21 01:25:47,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:25:47,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2146442010] [2020-07-21 01:25:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:47,236 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 01:25:47,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:25:47,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 52 conjunts are in the unsatisfiable core [2020-07-21 01:25:47,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:25:47,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:25:47,757 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:25:47,758 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 2 disjuncts [2020-07-21 01:25:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:25:47,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:25:47,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2146442010] [2020-07-21 01:25:47,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:25:47,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-21 01:25:47,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133626424] [2020-07-21 01:25:47,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 01:25:47,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:25:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 01:25:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-21 01:25:47,885 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 10 states. [2020-07-21 01:25:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:25:49,133 INFO L93 Difference]: Finished difference Result 527 states and 878 transitions. [2020-07-21 01:25:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 01:25:49,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2020-07-21 01:25:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:25:49,156 INFO L225 Difference]: With dead ends: 527 [2020-07-21 01:25:49,156 INFO L226 Difference]: Without dead ends: 229 [2020-07-21 01:25:49,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2020-07-21 01:25:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-07-21 01:25:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-07-21 01:25:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-21 01:25:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2020-07-21 01:25:49,252 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 94 [2020-07-21 01:25:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:25:49,254 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2020-07-21 01:25:49,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 01:25:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2020-07-21 01:25:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-07-21 01:25:49,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:25:49,267 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:25:49,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:49,481 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:25:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:25:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash 200842495, now seen corresponding path program 1 times [2020-07-21 01:25:49,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:25:49,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436764736] [2020-07-21 01:25:49,484 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:49,570 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 01:25:49,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:25:49,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-21 01:25:49,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:25:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:25:50,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:25:50,485 INFO L501 QuantifierPusher]: Distributing 6 disjuncts over 6 conjuncts [2020-07-21 01:25:50,487 INFO L501 QuantifierPusher]: Distributing 6 disjuncts over 5 conjuncts [2020-07-21 01:25:50,489 INFO L501 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-07-21 01:25:50,490 INFO L501 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-07-21 01:25:50,491 INFO L501 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-07-21 01:25:50,513 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 5, 1] term [2020-07-21 01:25:50,513 INFO L501 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-07-21 01:25:50,552 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:25:50,628 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:25:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:25:50,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436764736] [2020-07-21 01:25:50,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:25:50,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2020-07-21 01:25:50,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105606105] [2020-07-21 01:25:50,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 01:25:50,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:25:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 01:25:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 01:25:50,742 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 21 states. [2020-07-21 01:25:51,925 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-07-21 01:25:53,168 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-07-21 01:25:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:25:54,930 INFO L93 Difference]: Finished difference Result 738 states and 1083 transitions. [2020-07-21 01:25:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-21 01:25:54,932 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2020-07-21 01:25:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:25:54,937 INFO L225 Difference]: With dead ends: 738 [2020-07-21 01:25:54,938 INFO L226 Difference]: Without dead ends: 423 [2020-07-21 01:25:54,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=516, Invalid=1290, Unknown=0, NotChecked=0, Total=1806 [2020-07-21 01:25:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-07-21 01:25:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 393. [2020-07-21 01:25:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-07-21 01:25:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 533 transitions. [2020-07-21 01:25:54,982 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 533 transitions. Word has length 103 [2020-07-21 01:25:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:25:54,982 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 533 transitions. [2020-07-21 01:25:54,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 01:25:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 533 transitions. [2020-07-21 01:25:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-07-21 01:25:54,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:25:54,986 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:25:55,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:55,200 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:25:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:25:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1410212782, now seen corresponding path program 1 times [2020-07-21 01:25:55,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:25:55,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643801284] [2020-07-21 01:25:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:55,289 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 01:25:55,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:25:55,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 01:25:55,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:25:55,326 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-21 01:25:55,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:25:55,349 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:25:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:25:55,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:25:55,453 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 01:25:55,456 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:25:55,478 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 01:25:55,531 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:25:55,547 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:25:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:25:55,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643801284] [2020-07-21 01:25:55,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:25:55,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-21 01:25:55,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179747865] [2020-07-21 01:25:55,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 01:25:55,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:25:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 01:25:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-21 01:25:55,574 INFO L87 Difference]: Start difference. First operand 393 states and 533 transitions. Second operand 7 states. [2020-07-21 01:25:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:25:57,405 INFO L93 Difference]: Finished difference Result 1434 states and 2028 transitions. [2020-07-21 01:25:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 01:25:57,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2020-07-21 01:25:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:25:57,413 INFO L225 Difference]: With dead ends: 1434 [2020-07-21 01:25:57,414 INFO L226 Difference]: Without dead ends: 1047 [2020-07-21 01:25:57,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2020-07-21 01:25:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2020-07-21 01:25:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1015. [2020-07-21 01:25:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2020-07-21 01:25:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1272 transitions. [2020-07-21 01:25:57,488 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1272 transitions. Word has length 115 [2020-07-21 01:25:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:25:57,490 INFO L479 AbstractCegarLoop]: Abstraction has 1015 states and 1272 transitions. [2020-07-21 01:25:57,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 01:25:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1272 transitions. [2020-07-21 01:25:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-07-21 01:25:57,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:25:57,502 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:25:57,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:57,716 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:25:57,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:25:57,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1985131057, now seen corresponding path program 1 times [2020-07-21 01:25:57,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:25:57,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617749517] [2020-07-21 01:25:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:57,821 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:25:57,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:25:57,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 01:25:57,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:25:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-21 01:25:57,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:25:57,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617749517] [2020-07-21 01:25:57,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:25:57,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 01:25:57,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97935162] [2020-07-21 01:25:57,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 01:25:57,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:25:57,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 01:25:57,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 01:25:57,872 INFO L87 Difference]: Start difference. First operand 1015 states and 1272 transitions. Second operand 3 states. [2020-07-21 01:25:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:25:58,511 INFO L93 Difference]: Finished difference Result 2323 states and 2938 transitions. [2020-07-21 01:25:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 01:25:58,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2020-07-21 01:25:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:25:58,533 INFO L225 Difference]: With dead ends: 2323 [2020-07-21 01:25:58,534 INFO L226 Difference]: Without dead ends: 1314 [2020-07-21 01:25:58,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 01:25:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2020-07-21 01:25:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2020-07-21 01:25:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-07-21 01:25:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1639 transitions. [2020-07-21 01:25:58,609 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1639 transitions. Word has length 129 [2020-07-21 01:25:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:25:58,612 INFO L479 AbstractCegarLoop]: Abstraction has 1314 states and 1639 transitions. [2020-07-21 01:25:58,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 01:25:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1639 transitions. [2020-07-21 01:25:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-07-21 01:25:58,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:25:58,619 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, 1, 1, 1] [2020-07-21 01:25:58,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:58,835 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:25:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:25:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 383922729, now seen corresponding path program 1 times [2020-07-21 01:25:58,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:25:58,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394622548] [2020-07-21 01:25:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:58,937 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:25:58,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:25:58,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 01:25:58,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:25:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 01:25:58,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:25:58,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394622548] [2020-07-21 01:25:58,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:25:58,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 01:25:58,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946438401] [2020-07-21 01:25:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 01:25:58,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:25:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 01:25:58,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 01:25:58,985 INFO L87 Difference]: Start difference. First operand 1314 states and 1639 transitions. Second operand 3 states. [2020-07-21 01:25:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:25:59,608 INFO L93 Difference]: Finished difference Result 3231 states and 4165 transitions. [2020-07-21 01:25:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 01:25:59,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2020-07-21 01:25:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:25:59,621 INFO L225 Difference]: With dead ends: 3231 [2020-07-21 01:25:59,621 INFO L226 Difference]: Without dead ends: 1923 [2020-07-21 01:25:59,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 01:25:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2020-07-21 01:25:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1913. [2020-07-21 01:25:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1913 states. [2020-07-21 01:25:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2431 transitions. [2020-07-21 01:25:59,690 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2431 transitions. Word has length 136 [2020-07-21 01:25:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:25:59,691 INFO L479 AbstractCegarLoop]: Abstraction has 1913 states and 2431 transitions. [2020-07-21 01:25:59,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 01:25:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2431 transitions. [2020-07-21 01:25:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-21 01:25:59,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:25:59,697 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 01:25:59,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:25:59,913 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:25:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:25:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash 695192285, now seen corresponding path program 1 times [2020-07-21 01:25:59,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:25:59,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812181518] [2020-07-21 01:25:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:00,007 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 01:26:00,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:26:00,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 01:26:00,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:26:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-21 01:26:00,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:26:00,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812181518] [2020-07-21 01:26:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:26:00,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 01:26:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942171387] [2020-07-21 01:26:00,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 01:26:00,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:26:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 01:26:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 01:26:00,120 INFO L87 Difference]: Start difference. First operand 1913 states and 2431 transitions. Second operand 5 states. [2020-07-21 01:26:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:26:00,968 INFO L93 Difference]: Finished difference Result 5221 states and 7151 transitions. [2020-07-21 01:26:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 01:26:00,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2020-07-21 01:26:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:26:00,995 INFO L225 Difference]: With dead ends: 5221 [2020-07-21 01:26:00,995 INFO L226 Difference]: Without dead ends: 3314 [2020-07-21 01:26:01,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 01:26:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2020-07-21 01:26:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3262. [2020-07-21 01:26:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-07-21 01:26:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4137 transitions. [2020-07-21 01:26:01,134 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4137 transitions. Word has length 142 [2020-07-21 01:26:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:26:01,135 INFO L479 AbstractCegarLoop]: Abstraction has 3262 states and 4137 transitions. [2020-07-21 01:26:01,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 01:26:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4137 transitions. [2020-07-21 01:26:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 01:26:01,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:26:01,144 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07-21 01:26:01,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:01,358 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:26:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:26:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -393320421, now seen corresponding path program 1 times [2020-07-21 01:26:01,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:26:01,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1969366525] [2020-07-21 01:26:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:01,452 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 01:26:01,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:26:01,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 01:26:01,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:26:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-21 01:26:01,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:26:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-21 01:26:01,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1969366525] [2020-07-21 01:26:01,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:26:01,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-21 01:26:01,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017709900] [2020-07-21 01:26:01,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 01:26:01,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:26:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 01:26:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-21 01:26:01,637 INFO L87 Difference]: Start difference. First operand 3262 states and 4137 transitions. Second operand 7 states. [2020-07-21 01:26:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:26:02,887 INFO L93 Difference]: Finished difference Result 7436 states and 9506 transitions. [2020-07-21 01:26:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 01:26:02,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2020-07-21 01:26:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:26:02,904 INFO L225 Difference]: With dead ends: 7436 [2020-07-21 01:26:02,905 INFO L226 Difference]: Without dead ends: 2998 [2020-07-21 01:26:02,918 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-21 01:26:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2020-07-21 01:26:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2944. [2020-07-21 01:26:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2020-07-21 01:26:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3589 transitions. [2020-07-21 01:26:03,010 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3589 transitions. Word has length 157 [2020-07-21 01:26:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:26:03,010 INFO L479 AbstractCegarLoop]: Abstraction has 2944 states and 3589 transitions. [2020-07-21 01:26:03,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 01:26:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3589 transitions. [2020-07-21 01:26:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-07-21 01:26:03,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:26:03,020 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:26:03,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:03,235 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:26:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:26:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1891053973, now seen corresponding path program 1 times [2020-07-21 01:26:03,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:26:03,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379003430] [2020-07-21 01:26:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:03,319 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 01:26:03,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:26:03,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 01:26:03,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:26:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 01:26:03,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:26:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 01:26:03,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379003430] [2020-07-21 01:26:03,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:26:03,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 01:26:03,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238237114] [2020-07-21 01:26:03,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 01:26:03,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:26:03,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 01:26:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 01:26:03,443 INFO L87 Difference]: Start difference. First operand 2944 states and 3589 transitions. Second operand 6 states. [2020-07-21 01:26:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:26:03,932 INFO L93 Difference]: Finished difference Result 5564 states and 6767 transitions. [2020-07-21 01:26:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 01:26:03,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2020-07-21 01:26:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:26:03,946 INFO L225 Difference]: With dead ends: 5564 [2020-07-21 01:26:03,946 INFO L226 Difference]: Without dead ends: 2626 [2020-07-21 01:26:03,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-21 01:26:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2020-07-21 01:26:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2020-07-21 01:26:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2020-07-21 01:26:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3113 transitions. [2020-07-21 01:26:04,022 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 3113 transitions. Word has length 165 [2020-07-21 01:26:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:26:04,023 INFO L479 AbstractCegarLoop]: Abstraction has 2626 states and 3113 transitions. [2020-07-21 01:26:04,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 01:26:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3113 transitions. [2020-07-21 01:26:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-07-21 01:26:04,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:26:04,029 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 01:26:04,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:04,244 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:26:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:26:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash 148928496, now seen corresponding path program 1 times [2020-07-21 01:26:04,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:26:04,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743097099] [2020-07-21 01:26:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:04,323 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 01:26:04,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:26:04,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 01:26:04,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:26:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:26:04,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:26:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 01:26:04,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743097099] [2020-07-21 01:26:04,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:26:04,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-21 01:26:04,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779756300] [2020-07-21 01:26:04,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 01:26:04,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:26:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 01:26:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-21 01:26:04,454 INFO L87 Difference]: Start difference. First operand 2626 states and 3113 transitions. Second operand 7 states. [2020-07-21 01:26:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:26:05,769 INFO L93 Difference]: Finished difference Result 4747 states and 5622 transitions. [2020-07-21 01:26:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 01:26:05,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2020-07-21 01:26:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:26:05,778 INFO L225 Difference]: With dead ends: 4747 [2020-07-21 01:26:05,778 INFO L226 Difference]: Without dead ends: 1875 [2020-07-21 01:26:05,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2020-07-21 01:26:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-07-21 01:26:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1713. [2020-07-21 01:26:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2020-07-21 01:26:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 1846 transitions. [2020-07-21 01:26:05,830 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 1846 transitions. Word has length 173 [2020-07-21 01:26:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:26:05,830 INFO L479 AbstractCegarLoop]: Abstraction has 1713 states and 1846 transitions. [2020-07-21 01:26:05,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 01:26:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 1846 transitions. [2020-07-21 01:26:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 01:26:05,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:26:05,835 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-21 01:26:06,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:06,051 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:26:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:26:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash 781108354, now seen corresponding path program 1 times [2020-07-21 01:26:06,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:26:06,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74331534] [2020-07-21 01:26:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:06,175 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:26:06,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 01:26:06,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 01:26:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 01:26:06,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 01:26:06,461 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 01:26:06,461 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 01:26:06,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:26:06,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:26:06 BoogieIcfgContainer [2020-07-21 01:26:06,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 01:26:06,842 INFO L168 Benchmark]: Toolchain (without parser) took 22064.30 ms. Allocated memory was 138.4 MB in the beginning and 493.9 MB in the end (delta: 355.5 MB). Free memory was 101.5 MB in the beginning and 304.0 MB in the end (delta: -202.4 MB). Peak memory consumption was 153.0 MB. Max. memory is 7.1 GB. [2020-07-21 01:26:06,843 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 01:26:06,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.36 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 101.3 MB in the beginning and 171.7 MB in the end (delta: -70.4 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. [2020-07-21 01:26:06,845 INFO L168 Benchmark]: Boogie Preprocessor took 103.57 ms. Allocated memory is still 205.0 MB. Free memory was 171.7 MB in the beginning and 166.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-07-21 01:26:06,854 INFO L168 Benchmark]: RCFGBuilder took 1312.91 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.8 MB in the beginning and 182.9 MB in the end (delta: -16.1 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2020-07-21 01:26:06,856 INFO L168 Benchmark]: TraceAbstraction took 19911.86 ms. Allocated memory was 238.6 MB in the beginning and 493.9 MB in the end (delta: 255.3 MB). Free memory was 181.5 MB in the beginning and 304.0 MB in the end (delta: -122.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 7.1 GB. [2020-07-21 01:26:06,864 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.36 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 101.3 MB in the beginning and 171.7 MB in the end (delta: -70.4 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.57 ms. Allocated memory is still 205.0 MB. Free memory was 171.7 MB in the beginning and 166.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1312.91 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.8 MB in the beginning and 182.9 MB in the end (delta: -16.1 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19911.86 ms. Allocated memory was 238.6 MB in the beginning and 493.9 MB in the end (delta: 255.3 MB). Free memory was 181.5 MB in the beginning and 304.0 MB in the end (delta: -122.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 436]: 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)=19, \old(a11)=15, \old(a17)=32, \old(a19)=27, \old(a21)=30, \old(a25)=13, \old(a28)=20, \old(c)=31, \old(d)=29, \old(e)=14, \old(f)=2, \old(u)=28, \old(v)=16, \old(w)=18, \old(x)=17, \old(y)=33, \old(z)=12, 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=1, 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)=1, 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)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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=11, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, 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=11, 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)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, 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=0, 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=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L435] 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)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L436] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, 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.6s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 865 SDtfs, 4564 SDslu, 730 SDs, 0 SdLazy, 8466 SolverSat, 1162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1870 SyntacticMatches, 8 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3262occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 340 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1913 ConstructedInterpolants, 0 QuantifiedInterpolants, 1191414 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2901 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 798/820 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...