./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a72af9635062057dd6c19863d310cc14f9352c104eb0a387b7496a065455bebf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:55:29,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:55:29,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:55:29,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:55:29,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:55:29,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:55:29,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:55:29,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:55:29,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:55:29,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:55:29,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:55:29,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:55:29,654 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:55:29,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:55:29,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:55:29,657 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:55:29,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:55:29,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:55:29,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:55:29,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:55:29,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:55:29,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:55:29,660 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:55:29,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:55:29,661 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:55:29,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:55:29,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:55:29,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:55:29,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:55:29,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:55:29,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:55:29,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:55:29,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:55:29,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:55:29,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:55:29,666 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:55:29,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:55:29,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:55:29,667 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:55:29,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a72af9635062057dd6c19863d310cc14f9352c104eb0a387b7496a065455bebf [2023-11-19 07:55:29,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:55:30,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:55:30,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:55:30,009 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:55:30,009 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:55:30,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2023-11-19 07:55:33,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:55:33,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:55:33,387 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2023-11-19 07:55:33,418 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/data/acb91697a/775e1e3fddc84ee3bc1f8999627e0ffb/FLAG02b1b2def [2023-11-19 07:55:33,434 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/data/acb91697a/775e1e3fddc84ee3bc1f8999627e0ffb [2023-11-19 07:55:33,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:55:33,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:55:33,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:55:33,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:55:33,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:55:33,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:33" (1/1) ... [2023-11-19 07:55:33,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fbe4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:33, skipping insertion in model container [2023-11-19 07:55:33,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:33" (1/1) ... [2023-11-19 07:55:33,564 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:55:33,888 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/sv-benchmarks/c/eca-rers2012/Problem02_label44.c[15425,15438] [2023-11-19 07:55:33,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:55:33,946 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:55:34,099 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/sv-benchmarks/c/eca-rers2012/Problem02_label44.c[15425,15438] [2023-11-19 07:55:34,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:55:34,150 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:55:34,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34 WrapperNode [2023-11-19 07:55:34,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:55:34,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:55:34,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:55:34,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:55:34,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,277 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2023-11-19 07:55:34,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:55:34,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:55:34,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:55:34,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:55:34,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:55:34,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:55:34,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:55:34,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:55:34,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (1/1) ... [2023-11-19 07:55:34,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:55:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:55:34,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:55:34,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:55:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:55:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:55:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:55:34,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:55:34,537 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:55:34,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:55:35,678 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:55:35,695 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:55:35,695 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:55:35,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:35 BoogieIcfgContainer [2023-11-19 07:55:35,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:55:35,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:55:35,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:55:35,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:55:35,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:55:33" (1/3) ... [2023-11-19 07:55:35,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2760b114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:35, skipping insertion in model container [2023-11-19 07:55:35,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:34" (2/3) ... [2023-11-19 07:55:35,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2760b114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:35, skipping insertion in model container [2023-11-19 07:55:35,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:35" (3/3) ... [2023-11-19 07:55:35,718 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label44.c [2023-11-19 07:55:35,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:55:35,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:55:35,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:55:35,819 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1152db3e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:55:35,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:55:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 07:55:35,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:35,834 INFO L195 NwaCegarLoop]: 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] [2023-11-19 07:55:35,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:35,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1094583259, now seen corresponding path program 1 times [2023-11-19 07:55:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731150777] [2023-11-19 07:55:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731150777] [2023-11-19 07:55:36,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731150777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:36,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:36,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107831276] [2023-11-19 07:55:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:36,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:36,593 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:37,455 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2023-11-19 07:55:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-11-19 07:55:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:37,471 INFO L225 Difference]: With dead ends: 600 [2023-11-19 07:55:37,471 INFO L226 Difference]: Without dead ends: 309 [2023-11-19 07:55:37,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:37,479 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 78 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:37,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:55:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-19 07:55:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2023-11-19 07:55:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2023-11-19 07:55:37,559 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 88 [2023-11-19 07:55:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:37,561 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2023-11-19 07:55:37,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2023-11-19 07:55:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 07:55:37,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:37,572 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 07:55:37,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:55:37,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:37,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1802010064, now seen corresponding path program 1 times [2023-11-19 07:55:37,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:37,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671924103] [2023-11-19 07:55:37,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671924103] [2023-11-19 07:55:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671924103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106471904] [2023-11-19 07:55:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:37,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:37,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:37,813 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:38,408 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2023-11-19 07:55:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-11-19 07:55:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:38,413 INFO L225 Difference]: With dead ends: 758 [2023-11-19 07:55:38,414 INFO L226 Difference]: Without dead ends: 453 [2023-11-19 07:55:38,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:38,417 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 76 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:38,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:55:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-11-19 07:55:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2023-11-19 07:55:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2023-11-19 07:55:38,450 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 93 [2023-11-19 07:55:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:38,450 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2023-11-19 07:55:38,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2023-11-19 07:55:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-19 07:55:38,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:38,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:38,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:55:38,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:38,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2114149899, now seen corresponding path program 1 times [2023-11-19 07:55:38,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:38,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647739859] [2023-11-19 07:55:38,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:38,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:38,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647739859] [2023-11-19 07:55:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647739859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:38,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:38,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:38,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605956306] [2023-11-19 07:55:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:38,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:38,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:38,571 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:39,094 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2023-11-19 07:55:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:39,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-11-19 07:55:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:39,102 INFO L225 Difference]: With dead ends: 1325 [2023-11-19 07:55:39,102 INFO L226 Difference]: Without dead ends: 874 [2023-11-19 07:55:39,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:39,111 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:39,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:55:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2023-11-19 07:55:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2023-11-19 07:55:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2023-11-19 07:55:39,143 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 105 [2023-11-19 07:55:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:39,143 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2023-11-19 07:55:39,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2023-11-19 07:55:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:55:39,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:39,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:39,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:55:39,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:39,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 973538632, now seen corresponding path program 1 times [2023-11-19 07:55:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:39,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682992933] [2023-11-19 07:55:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682992933] [2023-11-19 07:55:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682992933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:39,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795003692] [2023-11-19 07:55:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:39,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:39,359 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:39,874 INFO L93 Difference]: Finished difference Result 2584 states and 3176 transitions. [2023-11-19 07:55:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2023-11-19 07:55:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:39,885 INFO L225 Difference]: With dead ends: 2584 [2023-11-19 07:55:39,885 INFO L226 Difference]: Without dead ends: 1712 [2023-11-19 07:55:39,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:39,888 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 106 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:39,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 75 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:55:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-11-19 07:55:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1432. [2023-11-19 07:55:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.2159329140461217) internal successors, (1740), 1431 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1740 transitions. [2023-11-19 07:55:39,927 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1740 transitions. Word has length 118 [2023-11-19 07:55:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:39,928 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1740 transitions. [2023-11-19 07:55:39,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1740 transitions. [2023-11-19 07:55:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:55:39,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:39,932 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:39,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:55:39,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:39,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -174462413, now seen corresponding path program 1 times [2023-11-19 07:55:39,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:39,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749507461] [2023-11-19 07:55:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:55:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:40,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749507461] [2023-11-19 07:55:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749507461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:40,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:40,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998280609] [2023-11-19 07:55:40,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:40,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:40,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:40,287 INFO L87 Difference]: Start difference. First operand 1432 states and 1740 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:41,108 INFO L93 Difference]: Finished difference Result 3365 states and 4132 transitions. [2023-11-19 07:55:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:55:41,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2023-11-19 07:55:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:41,119 INFO L225 Difference]: With dead ends: 3365 [2023-11-19 07:55:41,119 INFO L226 Difference]: Without dead ends: 1852 [2023-11-19 07:55:41,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:41,122 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 144 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:41,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 108 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:55:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2023-11-19 07:55:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1572. [2023-11-19 07:55:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.2151495862507957) internal successors, (1909), 1571 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1909 transitions. [2023-11-19 07:55:41,167 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1909 transitions. Word has length 122 [2023-11-19 07:55:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:41,167 INFO L495 AbstractCegarLoop]: Abstraction has 1572 states and 1909 transitions. [2023-11-19 07:55:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1909 transitions. [2023-11-19 07:55:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-19 07:55:41,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:41,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-19 07:55:41,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:55:41,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:41,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -479707149, now seen corresponding path program 1 times [2023-11-19 07:55:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:41,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547325558] [2023-11-19 07:55:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:41,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547325558] [2023-11-19 07:55:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547325558] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:55:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121038355] [2023-11-19 07:55:41,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:41,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:55:41,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:55:41,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:55:41,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:55:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:41,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:55:41,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:55:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 07:55:41,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:55:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121038355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:41,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:55:41,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-19 07:55:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705321286] [2023-11-19 07:55:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:41,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:41,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:55:41,961 INFO L87 Difference]: Start difference. First operand 1572 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:42,474 INFO L93 Difference]: Finished difference Result 4416 states and 5342 transitions. [2023-11-19 07:55:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:42,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2023-11-19 07:55:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:42,490 INFO L225 Difference]: With dead ends: 4416 [2023-11-19 07:55:42,490 INFO L226 Difference]: Without dead ends: 2846 [2023-11-19 07:55:42,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:55:42,506 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 107 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:42,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 118 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:55:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2023-11-19 07:55:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2838. [2023-11-19 07:55:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2837 states have (on average 1.185054635178005) internal successors, (3362), 2837 states have internal predecessors, (3362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3362 transitions. [2023-11-19 07:55:42,578 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3362 transitions. Word has length 158 [2023-11-19 07:55:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:42,578 INFO L495 AbstractCegarLoop]: Abstraction has 2838 states and 3362 transitions. [2023-11-19 07:55:42,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3362 transitions. [2023-11-19 07:55:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:55:42,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:42,585 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-19 07:55:42,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:55:42,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:55:42,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:42,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1234420955, now seen corresponding path program 1 times [2023-11-19 07:55:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:42,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489227169] [2023-11-19 07:55:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-19 07:55:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489227169] [2023-11-19 07:55:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489227169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946795277] [2023-11-19 07:55:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:43,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:43,010 INFO L87 Difference]: Start difference. First operand 2838 states and 3362 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:43,570 INFO L93 Difference]: Finished difference Result 6096 states and 7185 transitions. [2023-11-19 07:55:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:43,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2023-11-19 07:55:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:43,587 INFO L225 Difference]: With dead ends: 6096 [2023-11-19 07:55:43,587 INFO L226 Difference]: Without dead ends: 2978 [2023-11-19 07:55:43,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:43,592 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:43,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 49 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:55:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2023-11-19 07:55:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2023-11-19 07:55:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.107563025210084) internal successors, (3295), 2975 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3295 transitions. [2023-11-19 07:55:43,670 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3295 transitions. Word has length 160 [2023-11-19 07:55:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:43,671 INFO L495 AbstractCegarLoop]: Abstraction has 2976 states and 3295 transitions. [2023-11-19 07:55:43,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3295 transitions. [2023-11-19 07:55:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-19 07:55:43,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:43,677 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:43,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:55:43,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:43,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2138715965, now seen corresponding path program 1 times [2023-11-19 07:55:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:43,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482995634] [2023-11-19 07:55:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:55:43,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:55:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:55:43,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:55:43,852 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:55:43,853 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:55:43,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:55:43,858 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:43,863 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:55:44,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:55:44 BoogieIcfgContainer [2023-11-19 07:55:44,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:55:44,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:55:44,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:55:44,032 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:55:44,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:35" (3/4) ... [2023-11-19 07:55:44,033 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:55:44,198 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:55:44,198 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:55:44,199 INFO L158 Benchmark]: Toolchain (without parser) took 10755.99ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 115.3MB in the beginning and 181.0MB in the end (delta: -65.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,199 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 153.1MB. Free memory was 121.0MB in the beginning and 121.0MB in the end (delta: 76.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:55:44,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.49ms. Allocated memory is still 153.1MB. Free memory was 115.3MB in the beginning and 100.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.20ms. Allocated memory is still 153.1MB. Free memory was 100.4MB in the beginning and 95.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,200 INFO L158 Benchmark]: Boogie Preprocessor took 95.00ms. Allocated memory is still 153.1MB. Free memory was 95.1MB in the beginning and 90.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,201 INFO L158 Benchmark]: RCFGBuilder took 1330.68ms. Allocated memory is still 153.1MB. Free memory was 90.8MB in the beginning and 93.3MB in the end (delta: -2.5MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,201 INFO L158 Benchmark]: TraceAbstraction took 8323.09ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 92.5MB in the beginning and 194.6MB in the end (delta: -102.2MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,202 INFO L158 Benchmark]: Witness Printer took 166.81ms. Allocated memory is still 237.0MB. Free memory was 194.6MB in the beginning and 181.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:55:44,205 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 153.1MB. Free memory was 121.0MB in the beginning and 121.0MB in the end (delta: 76.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.49ms. Allocated memory is still 153.1MB. Free memory was 115.3MB in the beginning and 100.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.20ms. Allocated memory is still 153.1MB. Free memory was 100.4MB in the beginning and 95.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.00ms. Allocated memory is still 153.1MB. Free memory was 95.1MB in the beginning and 90.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1330.68ms. Allocated memory is still 153.1MB. Free memory was 90.8MB in the beginning and 93.3MB in the end (delta: -2.5MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8323.09ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 92.5MB in the beginning and 194.6MB in the end (delta: -102.2MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. * Witness Printer took 166.81ms. Allocated memory is still 237.0MB. Free memory was 194.6MB in the beginning and 181.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 446]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(input)=1, \result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] 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(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L360] a28 = 9 [L361] a11 = 1 [L362] a25 = 0 [L363] return -1; VAL [\old(input)=4, \result=-1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L399] 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(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, 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 !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L445] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L446] reach_error() VAL [\old(input)=4, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 856 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 856 mSDsluCounter, 848 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 620 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2873 IncrementalHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 620 mSolverCounterUnsat, 719 mSDtfsCounter, 2873 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2976occurred in iteration=7, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 572 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1164 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 4350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 360/364 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! [2023-11-19 07:55:44,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8fa8a0b-0c87-4d80-8c2e-2de2851493ce/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE