./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya --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 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:36:05,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:36:05,921 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-28 20:36:05,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:36:05,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:36:05,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:36:05,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:36:05,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:36:05,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:36:05,956 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:36:05,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:36:05,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:36:05,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:36:05,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:36:05,960 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:36:05,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:36:05,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:36:05,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:36:05,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:36:05,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:36:05,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:36:05,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:36:05,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:36:05,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:36:05,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:36:05,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:36:05,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:36:05,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:36:05,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:05,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:36:05,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:36:05,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:36:05,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:36:05,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:36:05,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:36:05,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:36:05,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:36:05,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:36:05,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:36:05,973 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2023-11-28 20:36:06,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:36:06,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:36:06,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:36:06,244 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:36:06,244 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:36:06,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-28 20:36:09,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:09,846 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:09,847 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-28 20:36:09,860 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data/773ea569a/a5b3451ef03c43998bcdc779347f9027/FLAGf4359c0d3 [2023-11-28 20:36:09,878 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data/773ea569a/a5b3451ef03c43998bcdc779347f9027 [2023-11-28 20:36:09,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:09,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:09,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:09,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:09,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:09,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:09" (1/1) ... [2023-11-28 20:36:09,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8404dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:09, skipping insertion in model container [2023-11-28 20:36:09,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:09" (1/1) ... [2023-11-28 20:36:09,949 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:10,135 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-28 20:36:10,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:10,321 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:36:10,333 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-28 20:36:10,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:10,464 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:36:10,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10 WrapperNode [2023-11-28 20:36:10,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:10,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:10,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:36:10,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:36:10,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,724 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1873 [2023-11-28 20:36:10,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:10,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:36:10,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:36:10,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:36:10,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:36:10,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:10,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:11,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:36:11,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:36:11,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:36:11,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:36:11,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (1/1) ... [2023-11-28 20:36:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:11,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:36:11,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:36:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:36:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:36:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:36:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:36:11,299 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:36:11,302 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:36:13,293 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:36:13,358 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:36:13,359 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:36:13,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:13 BoogieIcfgContainer [2023-11-28 20:36:13,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:36:13,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:36:13,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:36:13,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:36:13,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:36:09" (1/3) ... [2023-11-28 20:36:13,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4f3b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:13, skipping insertion in model container [2023-11-28 20:36:13,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:10" (2/3) ... [2023-11-28 20:36:13,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4f3b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:13, skipping insertion in model container [2023-11-28 20:36:13,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:13" (3/3) ... [2023-11-28 20:36:13,370 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-28 20:36:13,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:36:13,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:36:13,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:36:13,476 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;@7cccbfd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:36:13,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:36:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 446 states have (on average 1.6726457399103138) internal successors, (746), 447 states have internal predecessors, (746), 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-28 20:36:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-28 20:36:13,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:13,497 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] [2023-11-28 20:36:13,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:13,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1974890825, now seen corresponding path program 1 times [2023-11-28 20:36:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126672263] [2023-11-28 20:36:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,056 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-28 20:36:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126672263] [2023-11-28 20:36:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126672263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561341190] [2023-11-28 20:36:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:14,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:14,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:14,097 INFO L87 Difference]: Start difference. First operand has 448 states, 446 states have (on average 1.6726457399103138) internal successors, (746), 447 states have internal predecessors, (746), 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 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-28 20:36:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:14,205 INFO L93 Difference]: Finished difference Result 882 states and 1473 transitions. [2023-11-28 20:36:14,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2023-11-28 20:36:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:14,222 INFO L225 Difference]: With dead ends: 882 [2023-11-28 20:36:14,223 INFO L226 Difference]: Without dead ends: 465 [2023-11-28 20:36:14,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:14,230 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1397 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:14,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 844 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-11-28 20:36:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 446. [2023-11-28 20:36:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.6651685393258426) internal successors, (741), 445 states have internal predecessors, (741), 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-28 20:36:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 741 transitions. [2023-11-28 20:36:14,292 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 741 transitions. Word has length 58 [2023-11-28 20:36:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:14,293 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 741 transitions. [2023-11-28 20:36:14,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-28 20:36:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 741 transitions. [2023-11-28 20:36:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-28 20:36:14,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:14,297 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] [2023-11-28 20:36:14,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:36:14,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:14,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1884258687, now seen corresponding path program 1 times [2023-11-28 20:36:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007361362] [2023-11-28 20:36:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,589 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-28 20:36:14,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007361362] [2023-11-28 20:36:14,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007361362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:14,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:14,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:14,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891252959] [2023-11-28 20:36:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:14,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:14,598 INFO L87 Difference]: Start difference. First operand 446 states and 741 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-28 20:36:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:14,637 INFO L93 Difference]: Finished difference Result 450 states and 745 transitions. [2023-11-28 20:36:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2023-11-28 20:36:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:14,642 INFO L225 Difference]: With dead ends: 450 [2023-11-28 20:36:14,642 INFO L226 Difference]: Without dead ends: 448 [2023-11-28 20:36:14,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:14,644 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:14,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2209 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-28 20:36:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2023-11-28 20:36:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.662192393736018) internal successors, (743), 447 states have internal predecessors, (743), 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-28 20:36:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 743 transitions. [2023-11-28 20:36:14,669 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 743 transitions. Word has length 59 [2023-11-28 20:36:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:14,670 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 743 transitions. [2023-11-28 20:36:14,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-28 20:36:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 743 transitions. [2023-11-28 20:36:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-28 20:36:14,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:14,672 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] [2023-11-28 20:36:14,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:36:14,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:14,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1719248149, now seen corresponding path program 1 times [2023-11-28 20:36:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608286716] [2023-11-28 20:36:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,859 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-28 20:36:14,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608286716] [2023-11-28 20:36:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608286716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:14,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119935105] [2023-11-28 20:36:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:14,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:14,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:14,863 INFO L87 Difference]: Start difference. First operand 448 states and 743 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-28 20:36:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:14,906 INFO L93 Difference]: Finished difference Result 868 states and 1439 transitions. [2023-11-28 20:36:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:14,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2023-11-28 20:36:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:14,910 INFO L225 Difference]: With dead ends: 868 [2023-11-28 20:36:14,910 INFO L226 Difference]: Without dead ends: 451 [2023-11-28 20:36:14,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:14,912 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:14,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2207 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-28 20:36:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2023-11-28 20:36:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.6592427616926504) internal successors, (745), 449 states have internal predecessors, (745), 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-28 20:36:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 745 transitions. [2023-11-28 20:36:14,925 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 745 transitions. Word has length 60 [2023-11-28 20:36:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:14,926 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 745 transitions. [2023-11-28 20:36:14,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-28 20:36:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 745 transitions. [2023-11-28 20:36:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-28 20:36:14,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:14,928 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] [2023-11-28 20:36:14,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:36:14,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:14,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1546652955, now seen corresponding path program 1 times [2023-11-28 20:36:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442303749] [2023-11-28 20:36:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:15,064 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-28 20:36:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442303749] [2023-11-28 20:36:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442303749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663360253] [2023-11-28 20:36:15,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:15,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:15,067 INFO L87 Difference]: Start difference. First operand 450 states and 745 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-28 20:36:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:15,119 INFO L93 Difference]: Finished difference Result 1278 states and 2118 transitions. [2023-11-28 20:36:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2023-11-28 20:36:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:15,124 INFO L225 Difference]: With dead ends: 1278 [2023-11-28 20:36:15,124 INFO L226 Difference]: Without dead ends: 859 [2023-11-28 20:36:15,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:15,126 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 676 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:15,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2365 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-11-28 20:36:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 452. [2023-11-28 20:36:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.6563192904656319) internal successors, (747), 451 states have internal predecessors, (747), 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-28 20:36:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 747 transitions. [2023-11-28 20:36:15,138 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 747 transitions. Word has length 61 [2023-11-28 20:36:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:15,139 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 747 transitions. [2023-11-28 20:36:15,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-28 20:36:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 747 transitions. [2023-11-28 20:36:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-28 20:36:15,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:15,141 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] [2023-11-28 20:36:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:36:15,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:15,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1993458821, now seen corresponding path program 1 times [2023-11-28 20:36:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150118909] [2023-11-28 20:36:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:15,345 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-28 20:36:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150118909] [2023-11-28 20:36:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150118909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:15,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371451063] [2023-11-28 20:36:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:15,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:36:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:36:15,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:15,349 INFO L87 Difference]: Start difference. First operand 452 states and 747 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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-28 20:36:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:16,054 INFO L93 Difference]: Finished difference Result 1292 states and 2137 transitions. [2023-11-28 20:36:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:36:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2023-11-28 20:36:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:16,061 INFO L225 Difference]: With dead ends: 1292 [2023-11-28 20:36:16,061 INFO L226 Difference]: Without dead ends: 871 [2023-11-28 20:36:16,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:36:16,064 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 2068 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2068 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:16,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2068 Valid, 1653 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:36:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-11-28 20:36:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 503. [2023-11-28 20:36:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.653386454183267) internal successors, (830), 502 states have internal predecessors, (830), 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-28 20:36:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 830 transitions. [2023-11-28 20:36:16,116 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 830 transitions. Word has length 62 [2023-11-28 20:36:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:16,116 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 830 transitions. [2023-11-28 20:36:16,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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-28 20:36:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 830 transitions. [2023-11-28 20:36:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-28 20:36:16,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:16,119 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] [2023-11-28 20:36:16,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:36:16,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:16,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1908481465, now seen corresponding path program 1 times [2023-11-28 20:36:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426298602] [2023-11-28 20:36:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,356 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-28 20:36:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426298602] [2023-11-28 20:36:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426298602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:36:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084561868] [2023-11-28 20:36:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:16,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:36:16,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:36:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:16,359 INFO L87 Difference]: Start difference. First operand 503 states and 830 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-28 20:36:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:16,505 INFO L93 Difference]: Finished difference Result 1402 states and 2313 transitions. [2023-11-28 20:36:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:16,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2023-11-28 20:36:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:16,515 INFO L225 Difference]: With dead ends: 1402 [2023-11-28 20:36:16,515 INFO L226 Difference]: Without dead ends: 955 [2023-11-28 20:36:16,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:16,518 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 2059 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:16,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 2375 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2023-11-28 20:36:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 507. [2023-11-28 20:36:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.6482213438735178) internal successors, (834), 506 states have internal predecessors, (834), 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-28 20:36:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 834 transitions. [2023-11-28 20:36:16,542 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 834 transitions. Word has length 62 [2023-11-28 20:36:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:16,542 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 834 transitions. [2023-11-28 20:36:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-28 20:36:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 834 transitions. [2023-11-28 20:36:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-28 20:36:16,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:16,544 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] [2023-11-28 20:36:16,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:36:16,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:16,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1201586478, now seen corresponding path program 1 times [2023-11-28 20:36:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648561990] [2023-11-28 20:36:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:17,029 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-28 20:36:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:17,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648561990] [2023-11-28 20:36:17,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648561990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:17,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:17,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:36:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673220172] [2023-11-28 20:36:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:17,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:36:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:17,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:36:17,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:36:17,032 INFO L87 Difference]: Start difference. First operand 507 states and 834 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-28 20:36:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:17,340 INFO L93 Difference]: Finished difference Result 1421 states and 2340 transitions. [2023-11-28 20:36:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:36:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2023-11-28 20:36:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:17,348 INFO L225 Difference]: With dead ends: 1421 [2023-11-28 20:36:17,348 INFO L226 Difference]: Without dead ends: 975 [2023-11-28 20:36:17,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:17,350 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 2060 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:17,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 2959 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:36:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2023-11-28 20:36:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 511. [2023-11-28 20:36:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6431372549019607) internal successors, (838), 510 states have internal predecessors, (838), 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-28 20:36:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 838 transitions. [2023-11-28 20:36:17,373 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 838 transitions. Word has length 63 [2023-11-28 20:36:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:17,373 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 838 transitions. [2023-11-28 20:36:17,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-28 20:36:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 838 transitions. [2023-11-28 20:36:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-28 20:36:17,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:17,375 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] [2023-11-28 20:36:17,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:36:17,375 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:17,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1342135088, now seen corresponding path program 1 times [2023-11-28 20:36:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322287559] [2023-11-28 20:36:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:17,559 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-28 20:36:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322287559] [2023-11-28 20:36:17,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322287559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:17,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:17,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713096126] [2023-11-28 20:36:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:17,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:17,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:17,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:17,562 INFO L87 Difference]: Start difference. First operand 511 states and 838 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-28 20:36:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:17,609 INFO L93 Difference]: Finished difference Result 962 states and 1580 transitions. [2023-11-28 20:36:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:17,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2023-11-28 20:36:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:17,614 INFO L225 Difference]: With dead ends: 962 [2023-11-28 20:36:17,614 INFO L226 Difference]: Without dead ends: 511 [2023-11-28 20:36:17,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:17,616 INFO L413 NwaCegarLoop]: 769 mSDtfsCounter, 1391 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:17,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 855 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-28 20:36:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2023-11-28 20:36:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6392156862745098) internal successors, (836), 510 states have internal predecessors, (836), 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-28 20:36:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 836 transitions. [2023-11-28 20:36:17,636 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 836 transitions. Word has length 63 [2023-11-28 20:36:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:17,636 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 836 transitions. [2023-11-28 20:36:17,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-28 20:36:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 836 transitions. [2023-11-28 20:36:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-28 20:36:17,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:17,638 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] [2023-11-28 20:36:17,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:36:17,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:17,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1513329592, now seen corresponding path program 1 times [2023-11-28 20:36:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:17,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599048188] [2023-11-28 20:36:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:17,882 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-28 20:36:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599048188] [2023-11-28 20:36:17,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599048188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:17,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:17,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666048183] [2023-11-28 20:36:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:17,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:36:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:36:17,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:17,886 INFO L87 Difference]: Start difference. First operand 511 states and 836 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-28 20:36:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:17,999 INFO L93 Difference]: Finished difference Result 1350 states and 2217 transitions. [2023-11-28 20:36:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:36:18,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2023-11-28 20:36:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:18,006 INFO L225 Difference]: With dead ends: 1350 [2023-11-28 20:36:18,007 INFO L226 Difference]: Without dead ends: 893 [2023-11-28 20:36:18,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:18,009 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 2782 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:18,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2782 Valid, 2235 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-11-28 20:36:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 506. [2023-11-28 20:36:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.6376237623762375) internal successors, (827), 505 states have internal predecessors, (827), 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-28 20:36:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 827 transitions. [2023-11-28 20:36:18,036 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 827 transitions. Word has length 63 [2023-11-28 20:36:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:18,037 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 827 transitions. [2023-11-28 20:36:18,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-28 20:36:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 827 transitions. [2023-11-28 20:36:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-28 20:36:18,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:18,038 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] [2023-11-28 20:36:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:36:18,039 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:18,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 770118977, now seen corresponding path program 1 times [2023-11-28 20:36:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411819148] [2023-11-28 20:36:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:18,276 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-28 20:36:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411819148] [2023-11-28 20:36:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411819148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838613587] [2023-11-28 20:36:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:18,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:18,278 INFO L87 Difference]: Start difference. First operand 506 states and 827 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-28 20:36:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:18,493 INFO L93 Difference]: Finished difference Result 1380 states and 2259 transitions. [2023-11-28 20:36:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2023-11-28 20:36:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:18,501 INFO L225 Difference]: With dead ends: 1380 [2023-11-28 20:36:18,501 INFO L226 Difference]: Without dead ends: 937 [2023-11-28 20:36:18,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-28 20:36:18,503 INFO L413 NwaCegarLoop]: 1341 mSDtfsCounter, 1376 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:18,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2034 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:36:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2023-11-28 20:36:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 509. [2023-11-28 20:36:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.624015748031496) internal successors, (825), 508 states have internal predecessors, (825), 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-28 20:36:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 825 transitions. [2023-11-28 20:36:18,525 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 825 transitions. Word has length 64 [2023-11-28 20:36:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:18,525 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 825 transitions. [2023-11-28 20:36:18,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-28 20:36:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 825 transitions. [2023-11-28 20:36:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-28 20:36:18,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:18,527 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] [2023-11-28 20:36:18,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:36:18,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:18,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 800873730, now seen corresponding path program 1 times [2023-11-28 20:36:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170907148] [2023-11-28 20:36:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:19,355 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-28 20:36:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170907148] [2023-11-28 20:36:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170907148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:36:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864297454] [2023-11-28 20:36:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:19,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:19,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:19,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:19,358 INFO L87 Difference]: Start difference. First operand 509 states and 825 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 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-28 20:36:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:20,562 INFO L93 Difference]: Finished difference Result 2650 states and 4325 transitions. [2023-11-28 20:36:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:36:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 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 65 [2023-11-28 20:36:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:20,577 INFO L225 Difference]: With dead ends: 2650 [2023-11-28 20:36:20,577 INFO L226 Difference]: Without dead ends: 2208 [2023-11-28 20:36:20,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-11-28 20:36:20,580 INFO L413 NwaCegarLoop]: 2057 mSDtfsCounter, 4716 mSDsluCounter, 9640 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 11697 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:20,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 11697 Invalid, 397 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:36:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-11-28 20:36:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 523. [2023-11-28 20:36:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.6130268199233717) internal successors, (842), 522 states have internal predecessors, (842), 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-28 20:36:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 842 transitions. [2023-11-28 20:36:20,611 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 842 transitions. Word has length 65 [2023-11-28 20:36:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:20,611 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 842 transitions. [2023-11-28 20:36:20,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 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-28 20:36:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 842 transitions. [2023-11-28 20:36:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-28 20:36:20,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:20,613 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] [2023-11-28 20:36:20,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:36:20,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:20,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1223575556, now seen corresponding path program 1 times [2023-11-28 20:36:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549272797] [2023-11-28 20:36:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:21,061 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-28 20:36:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549272797] [2023-11-28 20:36:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549272797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:36:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380118647] [2023-11-28 20:36:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:21,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:36:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:36:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:36:21,064 INFO L87 Difference]: Start difference. First operand 523 states and 842 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 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-28 20:36:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:21,241 INFO L93 Difference]: Finished difference Result 1394 states and 2260 transitions. [2023-11-28 20:36:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:21,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 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 65 [2023-11-28 20:36:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:21,249 INFO L225 Difference]: With dead ends: 1394 [2023-11-28 20:36:21,249 INFO L226 Difference]: Without dead ends: 957 [2023-11-28 20:36:21,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:21,251 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 2638 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2638 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:21,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2638 Valid, 3859 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2023-11-28 20:36:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 529. [2023-11-28 20:36:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.6098484848484849) internal successors, (850), 528 states have internal predecessors, (850), 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-28 20:36:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 850 transitions. [2023-11-28 20:36:21,274 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 850 transitions. Word has length 65 [2023-11-28 20:36:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:21,274 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 850 transitions. [2023-11-28 20:36:21,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 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-28 20:36:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 850 transitions. [2023-11-28 20:36:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-28 20:36:21,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:21,276 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] [2023-11-28 20:36:21,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:36:21,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:21,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash -306144504, now seen corresponding path program 1 times [2023-11-28 20:36:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408012805] [2023-11-28 20:36:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:21,933 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-28 20:36:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408012805] [2023-11-28 20:36:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408012805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:36:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772532937] [2023-11-28 20:36:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:21,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:36:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:36:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:21,936 INFO L87 Difference]: Start difference. First operand 529 states and 850 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-28 20:36:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:22,328 INFO L93 Difference]: Finished difference Result 1007 states and 1622 transitions. [2023-11-28 20:36:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2023-11-28 20:36:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:22,333 INFO L225 Difference]: With dead ends: 1007 [2023-11-28 20:36:22,333 INFO L226 Difference]: Without dead ends: 552 [2023-11-28 20:36:22,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:36:22,335 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 1403 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:22,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 2912 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:36:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-11-28 20:36:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 543. [2023-11-28 20:36:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.6014760147601477) internal successors, (868), 542 states have internal predecessors, (868), 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-28 20:36:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 868 transitions. [2023-11-28 20:36:22,355 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 868 transitions. Word has length 66 [2023-11-28 20:36:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:22,355 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 868 transitions. [2023-11-28 20:36:22,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-28 20:36:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 868 transitions. [2023-11-28 20:36:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-28 20:36:22,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:22,357 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] [2023-11-28 20:36:22,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:36:22,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:22,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1995088246, now seen corresponding path program 1 times [2023-11-28 20:36:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782766484] [2023-11-28 20:36:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:22,554 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-28 20:36:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782766484] [2023-11-28 20:36:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782766484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:22,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041383549] [2023-11-28 20:36:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:22,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:22,557 INFO L87 Difference]: Start difference. First operand 543 states and 868 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-28 20:36:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:22,711 INFO L93 Difference]: Finished difference Result 1426 states and 2298 transitions. [2023-11-28 20:36:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:22,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2023-11-28 20:36:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:22,719 INFO L225 Difference]: With dead ends: 1426 [2023-11-28 20:36:22,719 INFO L226 Difference]: Without dead ends: 965 [2023-11-28 20:36:22,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-28 20:36:22,721 INFO L413 NwaCegarLoop]: 1340 mSDtfsCounter, 1418 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:22,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 2038 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-11-28 20:36:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 539. [2023-11-28 20:36:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.6022304832713754) internal successors, (862), 538 states have internal predecessors, (862), 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-28 20:36:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 862 transitions. [2023-11-28 20:36:22,744 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 862 transitions. Word has length 66 [2023-11-28 20:36:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:22,744 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 862 transitions. [2023-11-28 20:36:22,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-28 20:36:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 862 transitions. [2023-11-28 20:36:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-28 20:36:22,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:22,745 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] [2023-11-28 20:36:22,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:36:22,746 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:22,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2009424954, now seen corresponding path program 1 times [2023-11-28 20:36:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094609872] [2023-11-28 20:36:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:23,172 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-28 20:36:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094609872] [2023-11-28 20:36:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094609872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:36:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844455689] [2023-11-28 20:36:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:23,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:36:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:23,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:36:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:23,175 INFO L87 Difference]: Start difference. First operand 539 states and 862 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-28 20:36:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:23,547 INFO L93 Difference]: Finished difference Result 1862 states and 3012 transitions. [2023-11-28 20:36:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:36:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 67 [2023-11-28 20:36:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:23,557 INFO L225 Difference]: With dead ends: 1862 [2023-11-28 20:36:23,557 INFO L226 Difference]: Without dead ends: 1408 [2023-11-28 20:36:23,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:36:23,559 INFO L413 NwaCegarLoop]: 1403 mSDtfsCounter, 1394 mSDsluCounter, 7086 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 8489 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:23,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 8489 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:36:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-28 20:36:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 547. [2023-11-28 20:36:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.5970695970695972) internal successors, (872), 546 states have internal predecessors, (872), 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-28 20:36:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 872 transitions. [2023-11-28 20:36:23,586 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 872 transitions. Word has length 67 [2023-11-28 20:36:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:23,586 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 872 transitions. [2023-11-28 20:36:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-28 20:36:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 872 transitions. [2023-11-28 20:36:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-28 20:36:23,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:23,588 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] [2023-11-28 20:36:23,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:36:23,588 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:23,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 697194440, now seen corresponding path program 1 times [2023-11-28 20:36:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:23,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333307305] [2023-11-28 20:36:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:23,898 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-28 20:36:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333307305] [2023-11-28 20:36:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333307305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:23,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:36:23,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929792676] [2023-11-28 20:36:23,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:23,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:36:23,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:36:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:36:23,902 INFO L87 Difference]: Start difference. First operand 547 states and 872 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-28 20:36:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:24,076 INFO L93 Difference]: Finished difference Result 1003 states and 1612 transitions. [2023-11-28 20:36:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:36:24,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2023-11-28 20:36:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:24,079 INFO L225 Difference]: With dead ends: 1003 [2023-11-28 20:36:24,079 INFO L226 Difference]: Without dead ends: 533 [2023-11-28 20:36:24,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:24,080 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 713 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:24,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2776 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-11-28 20:36:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 529. [2023-11-28 20:36:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.6041666666666667) internal successors, (847), 528 states have internal predecessors, (847), 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-28 20:36:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 847 transitions. [2023-11-28 20:36:24,091 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 847 transitions. Word has length 67 [2023-11-28 20:36:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:24,091 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 847 transitions. [2023-11-28 20:36:24,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-28 20:36:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 847 transitions. [2023-11-28 20:36:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-28 20:36:24,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:24,092 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] [2023-11-28 20:36:24,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:36:24,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:24,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 480104008, now seen corresponding path program 1 times [2023-11-28 20:36:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360136344] [2023-11-28 20:36:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:24,225 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-28 20:36:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360136344] [2023-11-28 20:36:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360136344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539223373] [2023-11-28 20:36:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:24,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:24,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:24,227 INFO L87 Difference]: Start difference. First operand 529 states and 847 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 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-28 20:36:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:24,301 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2023-11-28 20:36:24,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:24,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2023-11-28 20:36:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:24,305 INFO L225 Difference]: With dead ends: 988 [2023-11-28 20:36:24,305 INFO L226 Difference]: Without dead ends: 541 [2023-11-28 20:36:24,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:24,306 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 697 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:24,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1424 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-11-28 20:36:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 531. [2023-11-28 20:36:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6018867924528302) internal successors, (849), 530 states have internal predecessors, (849), 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-28 20:36:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 849 transitions. [2023-11-28 20:36:24,319 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 849 transitions. Word has length 67 [2023-11-28 20:36:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:24,319 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 849 transitions. [2023-11-28 20:36:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 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-28 20:36:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 849 transitions. [2023-11-28 20:36:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-28 20:36:24,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:24,320 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] [2023-11-28 20:36:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:36:24,320 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:24,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1108243894, now seen corresponding path program 1 times [2023-11-28 20:36:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793553065] [2023-11-28 20:36:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:24,591 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-28 20:36:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793553065] [2023-11-28 20:36:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793553065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:36:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356884482] [2023-11-28 20:36:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:24,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:36:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:36:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:36:24,593 INFO L87 Difference]: Start difference. First operand 531 states and 849 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-28 20:36:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:24,932 INFO L93 Difference]: Finished difference Result 1404 states and 2265 transitions. [2023-11-28 20:36:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2023-11-28 20:36:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:24,937 INFO L225 Difference]: With dead ends: 1404 [2023-11-28 20:36:24,937 INFO L226 Difference]: Without dead ends: 965 [2023-11-28 20:36:24,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:36:24,938 INFO L413 NwaCegarLoop]: 1348 mSDtfsCounter, 2027 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5429 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:24,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5429 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:36:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-11-28 20:36:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 531. [2023-11-28 20:36:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6018867924528302) internal successors, (849), 530 states have internal predecessors, (849), 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-28 20:36:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 849 transitions. [2023-11-28 20:36:24,951 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 849 transitions. Word has length 67 [2023-11-28 20:36:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:24,951 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 849 transitions. [2023-11-28 20:36:24,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-28 20:36:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 849 transitions. [2023-11-28 20:36:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-28 20:36:24,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:24,952 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] [2023-11-28 20:36:24,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:36:24,953 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:24,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1695049908, now seen corresponding path program 1 times [2023-11-28 20:36:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957294371] [2023-11-28 20:36:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:36:24,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:36:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:36:25,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:36:25,049 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:36:25,050 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:36:25,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:36:25,054 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:25,057 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:36:25,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:36:25,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:36:25,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-28 20:36:25,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-28 20:36:25,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-28 20:36:25,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-28 20:36:25,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-28 20:36:25,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-28 20:36:25,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-28 20:36:25,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated [2023-11-28 20:36:25,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-28 20:36:25,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-28 20:36:25,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:36:25,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-28 20:36:25,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated [2023-11-28 20:36:25,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-28 20:36:25,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated [2023-11-28 20:36:25,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet20 could not be translated [2023-11-28 20:36:25,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-28 20:36:25,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-28 20:36:25,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet25 could not be translated [2023-11-28 20:36:25,101 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet27 could not be translated [2023-11-28 20:36:25,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-28 20:36:25,103 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-28 20:36:25,104 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-28 20:36:25,105 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet35 could not be translated [2023-11-28 20:36:25,107 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet36 could not be translated [2023-11-28 20:36:25,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet37 could not be translated [2023-11-28 20:36:25,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-28 20:36:25,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-28 20:36:25,111 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-28 20:36:25,111 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-28 20:36:25,112 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-28 20:36:25,112 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-28 20:36:25,112 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite41 could not be translated [2023-11-28 20:36:25,113 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet42 could not be translated [2023-11-28 20:36:25,114 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated [2023-11-28 20:36:25,114 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated [2023-11-28 20:36:25,114 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite46 could not be translated [2023-11-28 20:36:25,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet47 could not be translated [2023-11-28 20:36:25,116 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet48 could not be translated [2023-11-28 20:36:25,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet49 could not be translated [2023-11-28 20:36:25,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated [2023-11-28 20:36:25,118 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-28 20:36:25,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:36:25 BoogieIcfgContainer [2023-11-28 20:36:25,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:36:25,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:36:25,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:36:25,133 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:36:25,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:13" (3/4) ... [2023-11-28 20:36:25,135 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:36:25,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:36:25,136 INFO L158 Benchmark]: Toolchain (without parser) took 15254.03ms. Allocated memory was 155.2MB in the beginning and 415.2MB in the end (delta: 260.0MB). Free memory was 115.1MB in the beginning and 120.6MB in the end (delta: -5.4MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. [2023-11-28 20:36:25,137 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:36:25,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.64ms. Allocated memory is still 155.2MB. Free memory was 115.1MB in the beginning and 87.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-28 20:36:25,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 258.85ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 87.9MB in the beginning and 151.1MB in the end (delta: -63.2MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-11-28 20:36:25,138 INFO L158 Benchmark]: Boogie Preprocessor took 287.97ms. Allocated memory is still 216.0MB. Free memory was 151.1MB in the beginning and 131.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-28 20:36:25,138 INFO L158 Benchmark]: RCFGBuilder took 2345.84ms. Allocated memory is still 216.0MB. Free memory was 131.1MB in the beginning and 96.3MB in the end (delta: 34.9MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2023-11-28 20:36:25,139 INFO L158 Benchmark]: TraceAbstraction took 11769.86ms. Allocated memory was 216.0MB in the beginning and 415.2MB in the end (delta: 199.2MB). Free memory was 95.2MB in the beginning and 121.6MB in the end (delta: -26.4MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. [2023-11-28 20:36:25,139 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 415.2MB. Free memory was 121.6MB in the beginning and 120.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:36:25,141 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.17ms. Allocated memory is still 94.4MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.64ms. Allocated memory is still 155.2MB. Free memory was 115.1MB in the beginning and 87.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 258.85ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 87.9MB in the beginning and 151.1MB in the end (delta: -63.2MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 287.97ms. Allocated memory is still 216.0MB. Free memory was 151.1MB in the beginning and 131.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2345.84ms. Allocated memory is still 216.0MB. Free memory was 131.1MB in the beginning and 96.3MB in the end (delta: 34.9MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11769.86ms. Allocated memory was 216.0MB in the beginning and 415.2MB in the end (delta: 199.2MB). Free memory was 95.2MB in the beginning and 121.6MB in the end (delta: -26.4MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 415.2MB. Free memory was 121.6MB in the beginning and 120.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet50 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 17; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 20; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=20] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=20] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=20] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=20] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR var_33_arg_0 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=20] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_5=0, var_79=20] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=255, var_5=0, var_79=20] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=255, var_5=0, var_79=20] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=17, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=17, var_33_arg_0=18, var_33_arg_1=16, var_34=1, var_34_arg_0=17, var_34_arg_1=17, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=20] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 448 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28817 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28817 mSDsluCounter, 58360 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41250 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2242 IncrementalHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 17110 mSDtfsCounter, 2242 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=15, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 6379 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 3982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:36:25,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya --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 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:36:27,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:36:27,443 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-28 20:36:27,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:36:27,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:36:27,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:36:27,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:36:27,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:36:27,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:36:27,488 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:36:27,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:36:27,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:36:27,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:36:27,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:36:27,491 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:36:27,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:36:27,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:36:27,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:36:27,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:36:27,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:36:27,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:36:27,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:36:27,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:36:27,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:36:27,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:36:27,498 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:36:27,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:36:27,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:36:27,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:36:27,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:36:27,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:27,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:36:27,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:36:27,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:36:27,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:36:27,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:36:27,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:36:27,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:36:27,503 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:36:27,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:36:27,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:36:27,504 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:36:27,505 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2023-11-28 20:36:27,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:36:27,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:36:27,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:36:27,912 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:36:27,912 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:36:27,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-28 20:36:31,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:31,453 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:31,454 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-28 20:36:31,468 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data/7f01d2516/19f6537c6c624ea0a92a9259991e4a17/FLAG2563b326d [2023-11-28 20:36:31,487 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/data/7f01d2516/19f6537c6c624ea0a92a9259991e4a17 [2023-11-28 20:36:31,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:31,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:31,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:31,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:31,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:31,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:31" (1/1) ... [2023-11-28 20:36:31,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2431aae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:31, skipping insertion in model container [2023-11-28 20:36:31,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:31" (1/1) ... [2023-11-28 20:36:31,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:31,734 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-28 20:36:31,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:31,901 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:36:31,916 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_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2023-11-28 20:36:31,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:32,016 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:36:32,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32 WrapperNode [2023-11-28 20:36:32,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:32,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:32,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:36:32,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:36:32,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,094 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 455 [2023-11-28 20:36:32,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:32,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:36:32,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:36:32,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:36:32,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,141 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:36:32,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:36:32,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:36:32,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:36:32,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:36:32,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:32,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:32,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:36:32,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:36:32,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:36:32,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:36:32,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:36:32,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:36:32,447 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:36:32,449 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:36:32,986 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:36:33,025 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:36:33,026 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:36:33,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:33 BoogieIcfgContainer [2023-11-28 20:36:33,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:36:33,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:36:33,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:36:33,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:36:33,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:36:31" (1/3) ... [2023-11-28 20:36:33,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33be3673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:33, skipping insertion in model container [2023-11-28 20:36:33,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (2/3) ... [2023-11-28 20:36:33,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33be3673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:33, skipping insertion in model container [2023-11-28 20:36:33,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:33" (3/3) ... [2023-11-28 20:36:33,036 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2023-11-28 20:36:33,054 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:36:33,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:36:33,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:36:33,104 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;@acc9038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:36:33,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:36:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-28 20:36:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:36:33,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:33,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:36:33,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:33,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-11-28 20:36:33,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104088819] [2023-11-28 20:36:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:33,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:33,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:33,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:36:33,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:36:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:33,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 20:36:33,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:33,891 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-28 20:36:33,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:33,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104088819] [2023-11-28 20:36:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104088819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799986808] [2023-11-28 20:36:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:33,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:33,930 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-28 20:36:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:34,065 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-11-28 20:36:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-28 20:36:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:34,075 INFO L225 Difference]: With dead ends: 16 [2023-11-28 20:36:34,075 INFO L226 Difference]: Without dead ends: 9 [2023-11-28 20:36:34,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:34,080 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:34,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-28 20:36:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-11-28 20:36:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 20:36:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-28 20:36:34,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-11-28 20:36:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:34,107 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-28 20:36:34,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-28 20:36:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-28 20:36:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 20:36:34,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:34,108 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-28 20:36:34,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:36:34,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:34,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:34,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-11-28 20:36:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281608132] [2023-11-28 20:36:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:34,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:36:34,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:36:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-28 20:36:34,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:36:36,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:36:44,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281608132] [2023-11-28 20:36:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281608132] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:44,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-28 20:36:44,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938960164] [2023-11-28 20:36:44,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:44,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:44,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:44,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2023-11-28 20:36:44,278 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 20:36:57,200 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~var_32~0#1| (_ bv16 32)) (= |c_ULTIMATE.start_main_~var_28~0#1| (_ bv1 16)) (= (bvadd |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (_ bv1 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~msb_SORT_4~0#1| (_ bv2147483648 32)) (let ((.cse3 (exists ((|ULTIMATE.start_main_~var_40_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_40_arg_1~0#1|))) (_ bv1 32))))))) (or (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse0 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|) (_ bv1 32))))) (and (not (= .cse0 (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse0))))))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|)))) (exists ((|ULTIMATE.start_main_~var_39_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_39_arg_1~0#1|))))) (_ bv1 32)))))) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|)) (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv0 16))) (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse2 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|) (_ bv1 32)))) (.cse1 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_15|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse1))))))) (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse2)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (not (= .cse2 (_ bv0 8))) (not (= .cse1 (_ bv0 8)))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_91_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_86_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_15|) (_ bv1 32))))) (and (not (= .cse4 (_ bv0 8))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse4)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_91_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~var_86_arg_0~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))))) |c_ULTIMATE.start_main_~state_25~0#1|))))))) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) (= (_ bv17 32) |c_ULTIMATE.start_main_~var_27~0#1|) (or (let ((.cse9 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse11 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse8 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse16 (= |c_ULTIMATE.start_main_~input_37~0#1| (_ bv0 8)))) (let ((.cse5 (= |c_ULTIMATE.start_main_~input_38~0#1| (_ bv0 8))) (.cse6 (not .cse16)) (.cse12 (or .cse16 (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse17 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse8))) .cse8))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse17) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse17 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse18 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_13|))) .cse8))) .cse8))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse9 (bvashr (bvor .cse18 .cse11) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse18) (_ bv0 32))))))))) (and (or .cse5 (and (or .cse6 (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse7 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse8))) .cse8))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse7) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse7 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_39_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse10 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_13|))))) .cse8))) .cse8))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvor .cse9 (bvashr (bvor .cse10 .cse11) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse10) (_ bv0 32))))))) .cse12)) (or (not .cse5) (and (or .cse6 (let ((.cse14 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse8))) .cse8))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse13 (bvor .cse14 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse13 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse13) (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse15 (bvor .cse14 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_13|)))) (or (not (= (bvand (bvor .cse9 (bvashr (bvor .cse15 .cse11) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse15) (_ bv0 32)))))))) .cse12))))) (forall ((|v_ULTIMATE.start_main_~var_89_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_91_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_138_arg_1~0#1_14| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (let ((.cse19 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_13|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_14|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_138_arg_1~0#1_14|)))))))))))))))) (_ bv1 32))))))))))) is different from false [2023-11-28 20:36:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:57,544 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-11-28 20:36:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 7 [2023-11-28 20:36:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:57,546 INFO L225 Difference]: With dead ends: 14 [2023-11-28 20:36:57,546 INFO L226 Difference]: Without dead ends: 12 [2023-11-28 20:36:57,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=41, Invalid=92, Unknown=3, NotChecked=20, Total=156 [2023-11-28 20:36:57,548 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:57,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 7 Unchecked, 0.5s Time] [2023-11-28 20:36:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-28 20:36:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-11-28 20:36:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 20:36:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-11-28 20:36:57,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-11-28 20:36:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:57,557 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-11-28 20:36:57,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 20:36:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-11-28 20:36:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-28 20:36:57,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:57,558 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-11-28 20:36:57,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:36:57,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:57,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:57,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-11-28 20:36:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127741760] [2023-11-28 20:36:57,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:36:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:57,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:57,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:36:57,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:36:58,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:36:58,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:58,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-28 20:36:58,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:37:15,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:37:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:37:58,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:37:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127741760] [2023-11-28 20:37:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127741760] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:37:58,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:37:58,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-28 20:37:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537779966] [2023-11-28 20:37:58,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:37:58,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:37:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:37:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:37:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=137, Unknown=7, NotChecked=0, Total=182 [2023-11-28 20:37:58,750 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-28 20:38:10,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:38:14,225 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~var_32~0#1| (_ bv16 32)) (= |c_ULTIMATE.start_main_~var_30~0#1| (_ bv0 16)) (= |c_ULTIMATE.start_main_~var_28~0#1| (_ bv1 16)) (= (bvadd |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (_ bv1 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~msb_SORT_4~0#1| (_ bv2147483648 32)) (or (let ((.cse5 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse6 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse3 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse2 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_30~0#1|)) (.cse13 (= |c_ULTIMATE.start_main_~input_37~0#1| (_ bv0 8)))) (let ((.cse8 (= |c_ULTIMATE.start_main_~input_38~0#1| (_ bv0 8))) (.cse0 (not .cse13)) (.cse7 (or (and (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_14| (_ BitVec 16))) (let ((.cse11 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse3 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_14|)))))) .cse3))) (_ bv16 32)) .cse2))) (or (= (bvand .cse11 |c_ULTIMATE.start_main_~msb_SORT_4~0#1|) (_ bv0 32)) (not (= (bvand (bvor .cse5 (bvashr (bvor .cse11 .cse6) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_40_arg_1~0#1_14| (_ BitVec 16))) (let ((.cse12 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse3 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_40_arg_1~0#1_14|)))))) .cse3))) (_ bv16 32)) .cse2))) (or (not (= (bvand .cse12 |c_ULTIMATE.start_main_~msb_SORT_4~0#1|) (_ bv0 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse12 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)))))) .cse13))) (and (or (and (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_14| (_ BitVec 16))) (let ((.cse1 (bvor .cse2 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_14|))))) .cse3))) .cse3))) (_ bv16 32))))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse1) (_ bv0 32))) (not (= (bvand (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse1) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_39_arg_1~0#1_14| (_ BitVec 16))) (let ((.cse4 (bvor .cse2 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_39_arg_1~0#1_14|))))) .cse3))) .cse3))) (_ bv16 32))))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse4) (_ bv0 32)) (not (= (bvand (bvor .cse5 (bvashr (bvor .cse6 .cse4) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|))))))) .cse7) .cse8) (or (not .cse8) (and (or .cse0 (let ((.cse9 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse3))) .cse3))) (_ bv16 32)) .cse2))) (let ((.cse10 (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse9) (_ bv0 32)))) (and (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand .cse9 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not .cse10)) (or .cse10 (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse5 (bvashr (bvor .cse9 .cse6) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|))))))) .cse7))))) (forall ((|v_ULTIMATE.start_main_~var_91_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_0~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_123_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_89_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_109_arg_1~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_99_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_14| (_ BitVec 8))) (= ((_ extract 7 0) (let ((.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_91_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_89_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_0~0#1_14|))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_99_arg_1~0#1_14|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_109_arg_1~0#1_15|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_123_arg_1~0#1_14|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_14|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_25~0#1|))))))))))))) .cse14))))))))) (_ bv1 32)))) .cse14))) (_ bv0 8)))) (let ((.cse18 (exists ((|ULTIMATE.start_main_~var_40_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_40_arg_1~0#1|))) (_ bv1 32))))))) (or (and (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_21| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_21|) (_ bv1 32)))) (.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (= |c_ULTIMATE.start_main_~state_25~0#1| ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse15)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse16))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse17))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|)))) (_ bv1 32))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|))))))))))))) (not (= .cse15 (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse16))))))))) .cse18) (and (exists ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse19))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse20))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|)))) (_ bv1 32)))))))))) (_ bv1 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse19))))))))) (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv0 16))) (and (exists ((|ULTIMATE.start_main_~var_39_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_6~0#1| ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_39_arg_1~0#1|))))) (_ bv1 32))))) (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_21| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse22 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_21|) (_ bv1 32)))) (.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse21))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse22))))))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|))))))))) |c_ULTIMATE.start_main_~state_25~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (not (= (_ bv0 8) .cse22)) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse21)))))))))) (and .cse18 (exists ((|ULTIMATE.start_main_~var_89_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_84_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_76_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_137_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_21| (_ BitVec 8)) (|ULTIMATE.start_main_~var_77_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_138_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_109_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_99_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_21| (_ BitVec 8)) (|ULTIMATE.start_main_~var_68_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_123_arg_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_21|) (_ bv1 32)))) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse26 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_21|) (_ bv1 32)))) (.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~var_76_arg_1~0#1|))) (and (not (= .cse24 (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_138_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_123_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_99_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse24)))) (_ bv1 32)))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse26))))))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_84_arg_0~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_89_arg_1~0#1|))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_109_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_137_arg_1~0#1|)))))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_25~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse27 (_ bv0 32)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_68_arg_1~0#1|))) |c_ULTIMATE.start_main_~state_17~0#1|) (not (= (_ bv0 8) .cse26)) (= |c_ULTIMATE.start_main_~state_23~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_77_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse25)))))))))))) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) (= (_ bv17 32) |c_ULTIMATE.start_main_~var_27~0#1|)) is different from false [2023-11-28 20:38:27,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:38:31,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:38:37,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-28 20:38:37,129 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-28 20:38:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:38:37,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 69.6s TimeCoverageRelationStatistics Valid=68, Invalid=198, Unknown=10, NotChecked=30, Total=306 [2023-11-28 20:38:37,132 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:37,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 3 Unknown, 9 Unchecked, 13.3s Time] [2023-11-28 20:38:37,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 20:38:37,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:37,334 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 48 more [2023-11-28 20:38:37,338 INFO L158 Benchmark]: Toolchain (without parser) took 125845.62ms. Allocated memory was 75.5MB in the beginning and 268.4MB in the end (delta: 192.9MB). Free memory was 47.2MB in the beginning and 88.1MB in the end (delta: -40.9MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. [2023-11-28 20:38:37,338 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:38:37,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.57ms. Allocated memory is still 75.5MB. Free memory was 47.0MB in the beginning and 44.5MB in the end (delta: 2.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-11-28 20:38:37,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.88ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 40.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:38:37,340 INFO L158 Benchmark]: Boogie Preprocessor took 87.14ms. Allocated memory is still 75.5MB. Free memory was 40.1MB in the beginning and 34.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:38:37,340 INFO L158 Benchmark]: RCFGBuilder took 843.63ms. Allocated memory was 75.5MB in the beginning and 104.9MB in the end (delta: 29.4MB). Free memory was 34.7MB in the beginning and 65.9MB in the end (delta: -31.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-11-28 20:38:37,341 INFO L158 Benchmark]: TraceAbstraction took 124307.90ms. Allocated memory was 104.9MB in the beginning and 268.4MB in the end (delta: 163.6MB). Free memory was 65.0MB in the beginning and 88.1MB in the end (delta: -23.1MB). Peak memory consumption was 140.7MB. Max. memory is 16.1GB. [2023-11-28 20:38:37,344 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.18ms. Allocated memory is still 75.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.57ms. Allocated memory is still 75.5MB. Free memory was 47.0MB in the beginning and 44.5MB in the end (delta: 2.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.88ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 40.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.14ms. Allocated memory is still 75.5MB. Free memory was 40.1MB in the beginning and 34.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 843.63ms. Allocated memory was 75.5MB in the beginning and 104.9MB in the end (delta: 29.4MB). Free memory was 34.7MB in the beginning and 65.9MB in the end (delta: -31.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 124307.90ms. Allocated memory was 104.9MB in the beginning and 268.4MB in the end (delta: 163.6MB). Free memory was 65.0MB in the beginning and 88.1MB in the end (delta: -23.1MB). Peak memory consumption was 140.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed419fe2-bbd8-4a2d-be26-16c3e31bc271/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")