/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:34:44,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:34:44,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:34:44,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:34:44,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:34:44,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:34:44,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:34:44,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:34:44,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:34:44,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:34:44,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:34:44,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:34:44,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:34:44,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:34:44,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:34:44,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:34:44,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:34:44,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:34:44,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:34:44,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:34:44,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:34:44,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:34:44,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:34:44,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:34:44,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:34:44,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:34:44,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:34:44,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:34:44,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:34:44,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:34:44,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:34:44,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:34:44,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:34:44,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:34:44,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:34:44,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:34:44,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:34:44,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:34:44,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:34:44,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:34:44,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:34:44,532 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-10-23 18:34:44,620 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:34:44,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:34:44,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:34:44,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:34:44,630 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:34:44,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:34:44,631 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:34:44,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:34:44,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:34:44,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:34:44,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:34:44,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:34:44,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:34:44,635 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:34:44,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:34:44,636 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:34:44,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:34:44,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:34:44,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:34:44,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:34:44,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:34:44,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:34:44,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:34:44,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:34:44,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:34:44,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:34:44,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:34:44,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:34:44,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:34:44,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:34:45,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:34:45,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:34:45,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:34:45,314 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:34:45,315 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:34:45,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-10-23 18:34:45,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd92d936/33c25805f98d4b08a8d9aae2ebb06812/FLAGa8e37c7f3 [2020-10-23 18:34:46,587 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:34:46,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-10-23 18:34:46,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd92d936/33c25805f98d4b08a8d9aae2ebb06812/FLAGa8e37c7f3 [2020-10-23 18:34:46,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd92d936/33c25805f98d4b08a8d9aae2ebb06812 [2020-10-23 18:34:46,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:34:46,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:34:46,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:34:46,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:34:46,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:34:46,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:34:46" (1/1) ... [2020-10-23 18:34:46,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbd519a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:46, skipping insertion in model container [2020-10-23 18:34:46,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:34:46" (1/1) ... [2020-10-23 18:34:46,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:34:46,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:34:47,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:34:47,233 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:34:47,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:34:47,467 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:34:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47 WrapperNode [2020-10-23 18:34:47,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:34:47,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:34:47,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:34:47,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:34:47,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (1/1) ... [2020-10-23 18:34:47,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:34:47,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:34:47,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:34:47,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:34:47,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (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-10-23 18:34:47,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:34:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:34:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:34:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-23 18:34:47,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:34:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-23 18:34:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:34:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:34:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:34:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:34:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:34:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-23 18:34:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:34:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:34:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:34:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:34:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:34:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:34:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:34:49,387 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:34:49,387 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-23 18:34:49,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:34:49 BoogieIcfgContainer [2020-10-23 18:34:49,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:34:49,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:34:49,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:34:49,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:34:49,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:34:46" (1/3) ... [2020-10-23 18:34:49,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fec257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:34:49, skipping insertion in model container [2020-10-23 18:34:49,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:34:47" (2/3) ... [2020-10-23 18:34:49,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fec257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:34:49, skipping insertion in model container [2020-10-23 18:34:49,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:34:49" (3/3) ... [2020-10-23 18:34:49,407 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2020-10-23 18:34:49,430 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:34:49,440 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:34:49,459 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:34:49,508 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:34:49,509 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:34:49,509 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:34:49,509 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:34:49,509 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:34:49,509 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:34:49,509 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:34:49,510 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:34:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2020-10-23 18:34:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-23 18:34:49,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:34:49,570 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] [2020-10-23 18:34:49,571 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:34:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:34:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -969779467, now seen corresponding path program 1 times [2020-10-23 18:34:49,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:34:49,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582417516] [2020-10-23 18:34:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:34:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:50,520 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-23 18:34:50,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:34:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:34:50,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582417516] [2020-10-23 18:34:50,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:34:50,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-23 18:34:50,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449274139] [2020-10-23 18:34:50,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 18:34:50,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:34:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 18:34:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 18:34:50,633 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 4 states. [2020-10-23 18:34:50,877 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:34:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:34:53,410 INFO L93 Difference]: Finished difference Result 667 states and 1119 transitions. [2020-10-23 18:34:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-23 18:34:53,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-10-23 18:34:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:34:53,437 INFO L225 Difference]: With dead ends: 667 [2020-10-23 18:34:53,437 INFO L226 Difference]: Without dead ends: 342 [2020-10-23 18:34:53,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 18:34:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-10-23 18:34:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2020-10-23 18:34:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-23 18:34:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 489 transitions. [2020-10-23 18:34:53,578 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 489 transitions. Word has length 92 [2020-10-23 18:34:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:34:53,579 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 489 transitions. [2020-10-23 18:34:53,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 18:34:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 489 transitions. [2020-10-23 18:34:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-23 18:34:53,590 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:34:53,590 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:34:53,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:34:53,591 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:34:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:34:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash 417622825, now seen corresponding path program 1 times [2020-10-23 18:34:53,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:34:53,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69744685] [2020-10-23 18:34:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:34:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:53,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:34:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:53,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-23 18:34:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:34:54,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69744685] [2020-10-23 18:34:54,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:34:54,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:34:54,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598747933] [2020-10-23 18:34:54,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:34:54,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:34:54,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:34:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:34:54,013 INFO L87 Difference]: Start difference. First operand 338 states and 489 transitions. Second operand 7 states. [2020-10-23 18:34:54,195 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-23 18:34:54,808 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-23 18:34:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:34:56,559 INFO L93 Difference]: Finished difference Result 991 states and 1464 transitions. [2020-10-23 18:34:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:34:56,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2020-10-23 18:34:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:34:56,581 INFO L225 Difference]: With dead ends: 991 [2020-10-23 18:34:56,581 INFO L226 Difference]: Without dead ends: 659 [2020-10-23 18:34:56,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:34:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-23 18:34:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 643. [2020-10-23 18:34:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-10-23 18:34:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 883 transitions. [2020-10-23 18:34:56,713 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 883 transitions. Word has length 100 [2020-10-23 18:34:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:34:56,716 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 883 transitions. [2020-10-23 18:34:56,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:34:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 883 transitions. [2020-10-23 18:34:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-23 18:34:56,730 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:34:56,732 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:34:56,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:34:56,733 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:34:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:34:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash -46441168, now seen corresponding path program 1 times [2020-10-23 18:34:56,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:34:56,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986951692] [2020-10-23 18:34:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:34:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:56,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:34:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:56,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-23 18:34:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:34:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:34:57,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986951692] [2020-10-23 18:34:57,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:34:57,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:34:57,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377827614] [2020-10-23 18:34:57,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:34:57,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:34:57,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:34:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:34:57,056 INFO L87 Difference]: Start difference. First operand 643 states and 883 transitions. Second operand 7 states. [2020-10-23 18:34:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:34:59,904 INFO L93 Difference]: Finished difference Result 1925 states and 2786 transitions. [2020-10-23 18:34:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:34:59,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2020-10-23 18:34:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:34:59,977 INFO L225 Difference]: With dead ends: 1925 [2020-10-23 18:34:59,977 INFO L226 Difference]: Without dead ends: 1288 [2020-10-23 18:34:59,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:34:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2020-10-23 18:35:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1256. [2020-10-23 18:35:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-10-23 18:35:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1691 transitions. [2020-10-23 18:35:00,127 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1691 transitions. Word has length 103 [2020-10-23 18:35:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:35:00,127 INFO L481 AbstractCegarLoop]: Abstraction has 1256 states and 1691 transitions. [2020-10-23 18:35:00,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:35:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1691 transitions. [2020-10-23 18:35:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-10-23 18:35:00,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:35:00,137 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-10-23 18:35:00,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:35:00,138 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:35:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:35:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 543072021, now seen corresponding path program 1 times [2020-10-23 18:35:00,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:35:00,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827354449] [2020-10-23 18:35:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:35:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:00,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:35:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:00,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-23 18:35:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:00,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:35:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:35:00,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827354449] [2020-10-23 18:35:00,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532069630] [2020-10-23 18:35:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:35:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:00,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 18:35:00,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:35:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-23 18:35:00,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:35:00,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2020-10-23 18:35:00,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891815756] [2020-10-23 18:35:00,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-23 18:35:00,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:35:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-23 18:35:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:35:00,915 INFO L87 Difference]: Start difference. First operand 1256 states and 1691 transitions. Second operand 5 states. [2020-10-23 18:35:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:35:02,567 INFO L93 Difference]: Finished difference Result 3746 states and 5150 transitions. [2020-10-23 18:35:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:35:02,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2020-10-23 18:35:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:35:02,583 INFO L225 Difference]: With dead ends: 3746 [2020-10-23 18:35:02,583 INFO L226 Difference]: Without dead ends: 2496 [2020-10-23 18:35:02,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:35:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2020-10-23 18:35:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2456. [2020-10-23 18:35:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2020-10-23 18:35:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3039 transitions. [2020-10-23 18:35:02,706 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3039 transitions. Word has length 112 [2020-10-23 18:35:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:35:02,707 INFO L481 AbstractCegarLoop]: Abstraction has 2456 states and 3039 transitions. [2020-10-23 18:35:02,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-23 18:35:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3039 transitions. [2020-10-23 18:35:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 18:35:02,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:35:02,714 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] [2020-10-23 18:35:02,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:35:02,928 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:35:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:35:02,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2084392192, now seen corresponding path program 1 times [2020-10-23 18:35:02,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:35:02,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929882790] [2020-10-23 18:35:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:35:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:03,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:35:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:03,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-23 18:35:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:03,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:35:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:35:03,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929882790] [2020-10-23 18:35:03,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513913213] [2020-10-23 18:35:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:35:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:03,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-23 18:35:03,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:35:03,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-23 18:35:03,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-23 18:35:03,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-10-23 18:35:03,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:35:03,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-10-23 18:35:03,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815983633] [2020-10-23 18:35:03,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:35:03,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:35:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:35:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:35:03,570 INFO L87 Difference]: Start difference. First operand 2456 states and 3039 transitions. Second operand 11 states. [2020-10-23 18:35:04,639 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-23 18:35:04,817 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 18:35:05,258 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:35:05,592 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:35:05,785 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 18:35:06,919 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2020-10-23 18:35:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:35:10,939 INFO L93 Difference]: Finished difference Result 7108 states and 9649 transitions. [2020-10-23 18:35:10,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-23 18:35:10,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 113 [2020-10-23 18:35:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:35:10,976 INFO L225 Difference]: With dead ends: 7108 [2020-10-23 18:35:10,977 INFO L226 Difference]: Without dead ends: 4508 [2020-10-23 18:35:10,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-10-23 18:35:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2020-10-23 18:35:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4274. [2020-10-23 18:35:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2020-10-23 18:35:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5189 transitions. [2020-10-23 18:35:11,188 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5189 transitions. Word has length 113 [2020-10-23 18:35:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:35:11,188 INFO L481 AbstractCegarLoop]: Abstraction has 4274 states and 5189 transitions. [2020-10-23 18:35:11,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:35:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5189 transitions. [2020-10-23 18:35:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-23 18:35:11,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:35:11,196 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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-10-23 18:35:11,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:35:11,411 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:35:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:35:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1353508148, now seen corresponding path program 1 times [2020-10-23 18:35:11,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:35:11,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22160791] [2020-10-23 18:35:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:35:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:11,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:35:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:11,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-23 18:35:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:11,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-23 18:35:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:11,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:35:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-23 18:35:11,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22160791] [2020-10-23 18:35:11,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999250510] [2020-10-23 18:35:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:35:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:35:11,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-23 18:35:11,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:35:12,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-23 18:35:12,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-23 18:35:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-23 18:35:12,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:35:12,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2020-10-23 18:35:12,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627863753] [2020-10-23 18:35:12,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 18:35:12,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:35:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 18:35:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:35:12,084 INFO L87 Difference]: Start difference. First operand 4274 states and 5189 transitions. Second operand 14 states. [2020-10-23 18:35:12,273 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 18:35:12,717 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-23 18:35:12,941 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 18:35:13,786 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 18:35:14,030 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2020-10-23 18:35:14,241 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 18:35:14,696 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-23 18:35:15,462 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:35:15,628 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 18:35:16,182 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-23 18:35:16,866 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-23 18:35:17,390 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-10-23 18:35:17,626 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:35:18,005 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2020-10-23 18:35:19,509 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2020-10-23 18:35:19,765 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 18:35:19,923 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-23 18:35:20,237 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 18:35:21,866 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-23 18:35:23,060 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 18:35:23,333 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 18:35:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:35:25,840 INFO L93 Difference]: Finished difference Result 10840 states and 14196 transitions. [2020-10-23 18:35:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-10-23 18:35:25,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 121 [2020-10-23 18:35:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:35:25,879 INFO L225 Difference]: With dead ends: 10840 [2020-10-23 18:35:25,879 INFO L226 Difference]: Without dead ends: 6572 [2020-10-23 18:35:25,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1085, Invalid=6397, Unknown=0, NotChecked=0, Total=7482 [2020-10-23 18:35:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2020-10-23 18:35:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 6483. [2020-10-23 18:35:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6483 states. [2020-10-23 18:35:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6483 states to 6483 states and 7939 transitions. [2020-10-23 18:35:26,104 INFO L78 Accepts]: Start accepts. Automaton has 6483 states and 7939 transitions. Word has length 121 [2020-10-23 18:35:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:35:26,105 INFO L481 AbstractCegarLoop]: Abstraction has 6483 states and 7939 transitions. [2020-10-23 18:35:26,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 18:35:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6483 states and 7939 transitions. [2020-10-23 18:35:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-23 18:35:26,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:35:26,115 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] [2020-10-23 18:35:26,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:35:26,330 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:35:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:35:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1911016350, now seen corresponding path program 1 times [2020-10-23 18:35:26,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:35:26,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982405685] [2020-10-23 18:35:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:35:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:35:26,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:35:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:35:26,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:35:26,459 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:35:26,460 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:35:26,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:35:26,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:35:26 BoogieIcfgContainer [2020-10-23 18:35:26,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:35:26,641 INFO L168 Benchmark]: Toolchain (without parser) took 39984.21 ms. Allocated memory was 157.3 MB in the beginning and 512.8 MB in the end (delta: 355.5 MB). Free memory was 131.2 MB in the beginning and 242.2 MB in the end (delta: -111.0 MB). Peak memory consumption was 245.2 MB. Max. memory is 8.0 GB. [2020-10-23 18:35:26,642 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 157.3 MB. Free memory is still 129.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:35:26,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.77 ms. Allocated memory is still 157.3 MB. Free memory was 130.5 MB in the beginning and 137.5 MB in the end (delta: -7.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:35:26,645 INFO L168 Benchmark]: Boogie Preprocessor took 177.75 ms. Allocated memory is still 157.3 MB. Free memory was 137.5 MB in the beginning and 132.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-23 18:35:26,648 INFO L168 Benchmark]: RCFGBuilder took 1742.13 ms. Allocated memory is still 157.3 MB. Free memory was 132.3 MB in the beginning and 115.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 87.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:35:26,648 INFO L168 Benchmark]: TraceAbstraction took 37243.48 ms. Allocated memory was 157.3 MB in the beginning and 512.8 MB in the end (delta: 355.5 MB). Free memory was 115.1 MB in the beginning and 242.2 MB in the end (delta: -127.0 MB). Peak memory consumption was 229.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:35:26,654 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 157.3 MB. Free memory is still 129.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 805.77 ms. Allocated memory is still 157.3 MB. Free memory was 130.5 MB in the beginning and 137.5 MB in the end (delta: -7.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 177.75 ms. Allocated memory is still 157.3 MB. Free memory was 137.5 MB in the beginning and 132.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1742.13 ms. Allocated memory is still 157.3 MB. Free memory was 132.3 MB in the beginning and 115.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 87.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 37243.48 ms. Allocated memory was 157.3 MB in the beginning and 512.8 MB in the end (delta: 355.5 MB). Free memory was 115.1 MB in the beginning and 242.2 MB in the end (delta: -127.0 MB). Peak memory consumption was 229.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int a= 1; [L10] int e= 5; [L11] int d= 4; [L12] int f= 6; [L13] int c= 3; [L16] int u = 21; [L17] int v = 22; [L18] int w = 23; [L19] int x = 24; [L20] int y = 25; [L21] int z = 26; [L24] int a25 = 0; [L25] int a11 = 0; [L26] int a28 = 7; [L27] int a19 = 1; [L28] int a21 = 1; [L29] int a17 = 8; VAL [\old(a)=59, \old(a11)=72, \old(a17)=51, \old(a19)=64, \old(a21)=53, \old(a25)=56, \old(a28)=73, \old(c)=65, \old(d)=69, \old(e)=50, \old(f)=58, \old(u)=70, \old(v)=61, \old(w)=60, \old(x)=52, \old(y)=71, \old(z)=66, 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] [L605] 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] [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L168] a25 = 1 [L169] a28 = 9 [L170] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L616] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L616] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L32] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L33] a28 = 9 [L34] a11 = 1 [L35] a25 = 1 [L36] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L616] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L171] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L177] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L181] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L193] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L200] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L217] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L220] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L227] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L236] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L239] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L282] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L285] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L295] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L311] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L330] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L351] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L356] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L370] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L396] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L411] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L425] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L429] CALL reach_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L4] __assert_fail("0", "Problem02_label43.c", 4, "reach_error") VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.9s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 292 SDtfs, 7182 SDslu, 615 SDs, 0 SdLazy, 9299 SolverSat, 2320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3056 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6483occurred 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.9s AutomataMinimizationTime, 6 MinimizatonAttempts, 415 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1121 NumberOfCodeBlocks, 1121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 234694 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 172/193 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...