./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/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_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/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 32bit --witnessprinter.graph.data.programhash dcd8b7c9719c9e124f88c0306e66fdc794df6c79afaa727af6840898442d18a1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:07:47,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:07:47,594 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 07:07:47,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:07:47,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:07:47,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:07:47,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:07:47,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:07:47,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:07:47,627 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:07:47,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:07:47,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:07:47,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:07:47,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:07:47,630 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:07:47,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:07:47,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:07:47,632 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:07:47,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:07:47,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:07:47,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:07:47,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:07:47,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:07:47,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:07:47,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:07:47,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:07:47,637 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:07:47,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:07:47,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:07:47,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:07:47,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:07:47,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:07:47,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:07:47,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:07:47,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:07:47,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:07:47,641 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_fb9978eb-f655-4c6b-a8aa-75003ca8266d/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_fb9978eb-f655-4c6b-a8aa-75003ca8266d/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcd8b7c9719c9e124f88c0306e66fdc794df6c79afaa727af6840898442d18a1 [2023-11-29 07:07:47,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:07:47,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:07:47,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:07:47,861 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:07:47,862 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:07:47,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2023-11-29 07:07:50,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:07:50,767 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:07:50,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2023-11-29 07:07:50,775 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/data/a71ff900c/9c905063a45942e4bc0ccb22cddfd715/FLAG0cd5f45be [2023-11-29 07:07:50,788 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/data/a71ff900c/9c905063a45942e4bc0ccb22cddfd715 [2023-11-29 07:07:50,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:07:50,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:07:50,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:07:50,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:07:50,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:07:50,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:07:50" (1/1) ... [2023-11-29 07:07:50,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad5753b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:50, skipping insertion in model container [2023-11-29 07:07:50,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:07:50" (1/1) ... [2023-11-29 07:07:50,824 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:07:50,943 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_fb9978eb-f655-4c6b-a8aa-75003ca8266d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i[916,929] [2023-11-29 07:07:50,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:07:51,001 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:07:51,011 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_fb9978eb-f655-4c6b-a8aa-75003ca8266d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i[916,929] [2023-11-29 07:07:51,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:07:51,065 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:07:51,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51 WrapperNode [2023-11-29 07:07:51,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:07:51,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:07:51,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:07:51,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:07:51,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,123 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 362 [2023-11-29 07:07:51,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:07:51,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:07:51,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:07:51,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:07:51,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,162 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2023-11-29 07:07:51,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:07:51,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:07:51,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:07:51,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:07:51,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (1/1) ... [2023-11-29 07:07:51,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:07:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:07:51,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:07:51,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:07:51,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:07:51,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 07:07:51,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 07:07:51,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 07:07:51,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 07:07:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:07:51,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:07:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:07:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 07:07:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:07:51,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:07:51,384 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:07:51,386 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:07:51,751 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:07:51,799 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:07:51,799 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:07:51,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:07:51 BoogieIcfgContainer [2023-11-29 07:07:51,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:07:51,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:07:51,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:07:51,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:07:51,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:07:50" (1/3) ... [2023-11-29 07:07:51,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cd63ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:07:51, skipping insertion in model container [2023-11-29 07:07:51,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:51" (2/3) ... [2023-11-29 07:07:51,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cd63ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:07:51, skipping insertion in model container [2023-11-29 07:07:51,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:07:51" (3/3) ... [2023-11-29 07:07:51,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-76.i [2023-11-29 07:07:51,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:07:51,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:07:51,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:07:51,887 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;@61a5e182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:07:51,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:07:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 07:07:51,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:51,905 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:51,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:51,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -268641406, now seen corresponding path program 1 times [2023-11-29 07:07:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034704297] [2023-11-29 07:07:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034704297] [2023-11-29 07:07:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034704297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892549332] [2023-11-29 07:07:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:52,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:07:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:07:52,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:07:52,283 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:52,325 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-11-29 07:07:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:07:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-11-29 07:07:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:52,335 INFO L225 Difference]: With dead ends: 183 [2023-11-29 07:07:52,336 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 07:07:52,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:07:52,343 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:52,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:07:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 07:07:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 07:07:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-11-29 07:07:52,390 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-11-29 07:07:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:52,391 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-11-29 07:07:52,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-11-29 07:07:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 07:07:52,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:52,396 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:52,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:07:52,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:52,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash -691383482, now seen corresponding path program 1 times [2023-11-29 07:07:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200984532] [2023-11-29 07:07:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:52,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200984532] [2023-11-29 07:07:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200984532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:07:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879161871] [2023-11-29 07:07:52,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:52,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:52,737 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:52,769 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-11-29 07:07:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-11-29 07:07:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:52,772 INFO L225 Difference]: With dead ends: 177 [2023-11-29 07:07:52,772 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 07:07:52,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:52,775 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:52,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:07:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 07:07:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 07:07:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-11-29 07:07:52,788 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-11-29 07:07:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:52,790 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-11-29 07:07:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-11-29 07:07:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 07:07:52,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:52,793 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:52,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:07:52,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:52,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1659991216, now seen corresponding path program 1 times [2023-11-29 07:07:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864990667] [2023-11-29 07:07:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864990667] [2023-11-29 07:07:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864990667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 07:07:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623442230] [2023-11-29 07:07:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:54,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:07:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:54,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:07:54,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:07:54,654 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:55,632 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2023-11-29 07:07:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 07:07:55,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2023-11-29 07:07:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:55,638 INFO L225 Difference]: With dead ends: 288 [2023-11-29 07:07:55,638 INFO L226 Difference]: Without dead ends: 200 [2023-11-29 07:07:55,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-11-29 07:07:55,640 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 194 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:55,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 974 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 07:07:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-29 07:07:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 156. [2023-11-29 07:07:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.373134328358209) internal successors, (184), 135 states have internal predecessors, (184), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 07:07:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2023-11-29 07:07:55,661 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 115 [2023-11-29 07:07:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:55,662 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2023-11-29 07:07:55,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2023-11-29 07:07:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 07:07:55,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:55,665 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:55,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:07:55,665 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:55,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1817327630, now seen corresponding path program 1 times [2023-11-29 07:07:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455453418] [2023-11-29 07:07:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:55,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455453418] [2023-11-29 07:07:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455453418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:55,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:55,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:07:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812660754] [2023-11-29 07:07:55,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:55,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:55,799 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:55,822 INFO L93 Difference]: Finished difference Result 258 states and 365 transitions. [2023-11-29 07:07:55,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:55,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-11-29 07:07:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:55,825 INFO L225 Difference]: With dead ends: 258 [2023-11-29 07:07:55,825 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 07:07:55,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:55,827 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 218 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-29 07:07:55,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 218 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:07:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 07:07:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-29 07:07:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2023-11-29 07:07:55,840 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 115 [2023-11-29 07:07:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:55,841 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2023-11-29 07:07:55,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2023-11-29 07:07:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 07:07:55,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:55,843 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:55,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:07:55,843 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:55,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 687426485, now seen corresponding path program 1 times [2023-11-29 07:07:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:55,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655185482] [2023-11-29 07:07:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655185482] [2023-11-29 07:07:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655185482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:56,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:07:56,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060264243] [2023-11-29 07:07:56,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:56,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:07:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:56,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:07:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:07:56,837 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:57,291 INFO L93 Difference]: Finished difference Result 278 states and 385 transitions. [2023-11-29 07:07:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:07:57,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2023-11-29 07:07:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:57,293 INFO L225 Difference]: With dead ends: 278 [2023-11-29 07:07:57,293 INFO L226 Difference]: Without dead ends: 176 [2023-11-29 07:07:57,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:07:57,295 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 171 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:57,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 375 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:07:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-29 07:07:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 103. [2023-11-29 07:07:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2023-11-29 07:07:57,310 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 117 [2023-11-29 07:07:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:57,311 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2023-11-29 07:07:57,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2023-11-29 07:07:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 07:07:57,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:57,313 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:57,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:07:57,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:57,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2107864187, now seen corresponding path program 1 times [2023-11-29 07:07:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897091007] [2023-11-29 07:07:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897091007] [2023-11-29 07:07:57,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897091007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:57,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:07:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913746146] [2023-11-29 07:07:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:57,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:57,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:57,446 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:57,470 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2023-11-29 07:07:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:57,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-11-29 07:07:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:57,472 INFO L225 Difference]: With dead ends: 223 [2023-11-29 07:07:57,472 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 07:07:57,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:57,474 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:57,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:07:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 07:07:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2023-11-29 07:07:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2023-11-29 07:07:57,486 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 117 [2023-11-29 07:07:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:57,486 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2023-11-29 07:07:57,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2023-11-29 07:07:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 07:07:57,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:57,488 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:57,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:07:57,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:57,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1449334213, now seen corresponding path program 1 times [2023-11-29 07:07:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:57,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980969829] [2023-11-29 07:07:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980969829] [2023-11-29 07:07:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980969829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:07:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974684955] [2023-11-29 07:07:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:57,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:57,589 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:57,615 INFO L93 Difference]: Finished difference Result 207 states and 285 transitions. [2023-11-29 07:07:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-29 07:07:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:57,617 INFO L225 Difference]: With dead ends: 207 [2023-11-29 07:07:57,617 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 07:07:57,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:57,618 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:57,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:07:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 07:07:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-29 07:07:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2023-11-29 07:07:57,629 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 119 [2023-11-29 07:07:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:57,629 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2023-11-29 07:07:57,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2023-11-29 07:07:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 07:07:57,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:57,631 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:57,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:07:57,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:57,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2036140227, now seen corresponding path program 1 times [2023-11-29 07:07:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297184584] [2023-11-29 07:07:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297184584] [2023-11-29 07:07:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297184584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:58,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:58,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:07:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9844212] [2023-11-29 07:07:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:58,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:07:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:07:58,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:07:58,616 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:59,126 INFO L93 Difference]: Finished difference Result 263 states and 355 transitions. [2023-11-29 07:07:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:07:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-29 07:07:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:59,129 INFO L225 Difference]: With dead ends: 263 [2023-11-29 07:07:59,129 INFO L226 Difference]: Without dead ends: 159 [2023-11-29 07:07:59,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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-29 07:07:59,130 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 129 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:59,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 524 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:07:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-29 07:07:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2023-11-29 07:07:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2023-11-29 07:07:59,144 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 119 [2023-11-29 07:07:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:59,144 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2023-11-29 07:07:59,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:07:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2023-11-29 07:07:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 07:07:59,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:59,146 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:59,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:07:59,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:59,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash 896121367, now seen corresponding path program 1 times [2023-11-29 07:07:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116891403] [2023-11-29 07:07:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:07:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:07:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:07:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:07:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:07:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:07:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:07:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:07:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:07:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:07:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:07:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:07:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:07:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:07:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:07:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:59,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116891403] [2023-11-29 07:07:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116891403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:59,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:07:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650673384] [2023-11-29 07:07:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:59,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:07:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:59,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:07:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:07:59,334 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:59,407 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2023-11-29 07:07:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:07:59,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-29 07:07:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:59,409 INFO L225 Difference]: With dead ends: 227 [2023-11-29 07:07:59,409 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 07:07:59,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:07:59,410 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 98 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:59,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 593 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:07:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 07:07:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2023-11-29 07:07:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:07:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2023-11-29 07:07:59,424 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 119 [2023-11-29 07:07:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:59,424 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2023-11-29 07:07:59,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:07:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2023-11-29 07:07:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 07:07:59,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:59,426 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:07:59,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:07:59,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:59,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2037408384, now seen corresponding path program 1 times [2023-11-29 07:07:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:59,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592954045] [2023-11-29 07:07:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592954045] [2023-11-29 07:08:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592954045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:00,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:08:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773001133] [2023-11-29 07:08:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:00,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:08:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:00,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:08:00,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:08:00,450 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:08:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:00,746 INFO L93 Difference]: Finished difference Result 228 states and 305 transitions. [2023-11-29 07:08:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:08:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-11-29 07:08:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:00,749 INFO L225 Difference]: With dead ends: 228 [2023-11-29 07:08:00,749 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 07:08:00,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:08:00,750 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 113 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:00,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 536 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:08:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 07:08:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2023-11-29 07:08:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:08:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2023-11-29 07:08:00,767 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 121 [2023-11-29 07:08:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:00,768 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2023-11-29 07:08:00,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:08:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2023-11-29 07:08:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 07:08:00,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:00,770 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:00,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:08:00,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:00,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -751210596, now seen corresponding path program 1 times [2023-11-29 07:08:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138488221] [2023-11-29 07:08:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138488221] [2023-11-29 07:08:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138488221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:08:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363517867] [2023-11-29 07:08:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:01,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:08:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:08:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:01,820 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:08:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:02,311 INFO L93 Difference]: Finished difference Result 295 states and 397 transitions. [2023-11-29 07:08:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:08:02,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-11-29 07:08:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:02,314 INFO L225 Difference]: With dead ends: 295 [2023-11-29 07:08:02,314 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 07:08:02,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:08:02,316 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 198 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:02,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 411 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:08:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 07:08:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 110. [2023-11-29 07:08:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:08:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 146 transitions. [2023-11-29 07:08:02,334 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 146 transitions. Word has length 121 [2023-11-29 07:08:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:02,335 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 146 transitions. [2023-11-29 07:08:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 07:08:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 146 transitions. [2023-11-29 07:08:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 07:08:02,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:02,337 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:02,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 07:08:02,338 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:02,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash -60439536, now seen corresponding path program 1 times [2023-11-29 07:08:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60271737] [2023-11-29 07:08:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60271737] [2023-11-29 07:08:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60271737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:03,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:03,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:08:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112699170] [2023-11-29 07:08:03,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:03,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:08:03,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:08:03,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:08:03,492 INFO L87 Difference]: Start difference. First operand 110 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:04,332 INFO L93 Difference]: Finished difference Result 327 states and 434 transitions. [2023-11-29 07:08:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:08:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-11-29 07:08:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:04,337 INFO L225 Difference]: With dead ends: 327 [2023-11-29 07:08:04,337 INFO L226 Difference]: Without dead ends: 218 [2023-11-29 07:08:04,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:08:04,339 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 171 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:04,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 703 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 07:08:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-29 07:08:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2023-11-29 07:08:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 177 states have internal predecessors, (222), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 07:08:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 274 transitions. [2023-11-29 07:08:04,376 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 274 transitions. Word has length 123 [2023-11-29 07:08:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:04,376 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 274 transitions. [2023-11-29 07:08:04,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 274 transitions. [2023-11-29 07:08:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 07:08:04,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:04,379 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:04,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 07:08:04,380 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:04,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1482806458, now seen corresponding path program 1 times [2023-11-29 07:08:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095739849] [2023-11-29 07:08:04,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095739849] [2023-11-29 07:08:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095739849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054202926] [2023-11-29 07:08:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:04,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:08:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:08:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:08:04,685 INFO L87 Difference]: Start difference. First operand 207 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:05,013 INFO L93 Difference]: Finished difference Result 439 states and 581 transitions. [2023-11-29 07:08:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:08:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-29 07:08:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:05,018 INFO L225 Difference]: With dead ends: 439 [2023-11-29 07:08:05,018 INFO L226 Difference]: Without dead ends: 233 [2023-11-29 07:08:05,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:05,020 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:05,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 460 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:08:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-29 07:08:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2023-11-29 07:08:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 179 states have (on average 1.2513966480446927) internal successors, (224), 180 states have internal predecessors, (224), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 07:08:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2023-11-29 07:08:05,048 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 124 [2023-11-29 07:08:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:05,048 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2023-11-29 07:08:05,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2023-11-29 07:08:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 07:08:05,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:05,051 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:05,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 07:08:05,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:05,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1162199371, now seen corresponding path program 1 times [2023-11-29 07:08:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634546752] [2023-11-29 07:08:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634546752] [2023-11-29 07:08:05,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634546752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:05,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:05,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:08:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050356674] [2023-11-29 07:08:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:05,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:08:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:08:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:08:05,820 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 07:08:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:06,361 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2023-11-29 07:08:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:08:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2023-11-29 07:08:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:06,366 INFO L225 Difference]: With dead ends: 360 [2023-11-29 07:08:06,366 INFO L226 Difference]: Without dead ends: 358 [2023-11-29 07:08:06,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:08:06,367 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 89 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:06,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 466 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:08:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-11-29 07:08:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 355. [2023-11-29 07:08:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 294 states have (on average 1.2244897959183674) internal successors, (360), 297 states have internal predecessors, (360), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 07:08:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 460 transitions. [2023-11-29 07:08:06,438 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 460 transitions. Word has length 125 [2023-11-29 07:08:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:06,439 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 460 transitions. [2023-11-29 07:08:06,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 07:08:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 460 transitions. [2023-11-29 07:08:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 07:08:06,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:06,441 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:06,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 07:08:06,442 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:06,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash -908567350, now seen corresponding path program 1 times [2023-11-29 07:08:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093827569] [2023-11-29 07:08:06,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:06,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093827569] [2023-11-29 07:08:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093827569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:06,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:06,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:06,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584534104] [2023-11-29 07:08:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:06,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:08:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:06,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:08:06,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:08:06,758 INFO L87 Difference]: Start difference. First operand 355 states and 460 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:07,036 INFO L93 Difference]: Finished difference Result 717 states and 925 transitions. [2023-11-29 07:08:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:08:07,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-29 07:08:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:07,040 INFO L225 Difference]: With dead ends: 717 [2023-11-29 07:08:07,040 INFO L226 Difference]: Without dead ends: 363 [2023-11-29 07:08:07,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:07,041 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:07,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 350 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:08:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-29 07:08:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2023-11-29 07:08:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 290 states have (on average 1.210344827586207) internal successors, (351), 293 states have internal predecessors, (351), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 07:08:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 451 transitions. [2023-11-29 07:08:07,112 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 451 transitions. Word has length 125 [2023-11-29 07:08:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:07,113 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 451 transitions. [2023-11-29 07:08:07,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 451 transitions. [2023-11-29 07:08:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 07:08:07,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:07,116 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 07:08:07,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:07,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2003579264, now seen corresponding path program 1 times [2023-11-29 07:08:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466722980] [2023-11-29 07:08:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466722980] [2023-11-29 07:08:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466722980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:08:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116479928] [2023-11-29 07:08:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:07,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:08:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:08:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:08:07,613 INFO L87 Difference]: Start difference. First operand 353 states and 451 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:08,219 INFO L93 Difference]: Finished difference Result 898 states and 1147 transitions. [2023-11-29 07:08:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 07:08:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-29 07:08:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:08,224 INFO L225 Difference]: With dead ends: 898 [2023-11-29 07:08:08,225 INFO L226 Difference]: Without dead ends: 546 [2023-11-29 07:08:08,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-11-29 07:08:08,227 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 216 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:08,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1157 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:08:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-29 07:08:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 516. [2023-11-29 07:08:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 433 states have (on average 1.210161662817552) internal successors, (524), 438 states have internal predecessors, (524), 64 states have call successors, (64), 18 states have call predecessors, (64), 18 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 07:08:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 652 transitions. [2023-11-29 07:08:08,297 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 652 transitions. Word has length 126 [2023-11-29 07:08:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:08,298 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 652 transitions. [2023-11-29 07:08:08,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 652 transitions. [2023-11-29 07:08:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 07:08:08,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:08,300 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 07:08:08,300 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:08,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -80351230, now seen corresponding path program 1 times [2023-11-29 07:08:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242425373] [2023-11-29 07:08:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242425373] [2023-11-29 07:08:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242425373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384898592] [2023-11-29 07:08:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:08,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:08:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:08:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:08:08,517 INFO L87 Difference]: Start difference. First operand 516 states and 652 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:08,968 INFO L93 Difference]: Finished difference Result 1263 states and 1604 transitions. [2023-11-29 07:08:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:08:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-29 07:08:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:08,974 INFO L225 Difference]: With dead ends: 1263 [2023-11-29 07:08:08,974 INFO L226 Difference]: Without dead ends: 748 [2023-11-29 07:08:08,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:08:08,976 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 180 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:08,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 369 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:08:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-11-29 07:08:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 517. [2023-11-29 07:08:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 434 states have (on average 1.2027649769585254) internal successors, (522), 439 states have internal predecessors, (522), 64 states have call successors, (64), 18 states have call predecessors, (64), 18 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 07:08:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 650 transitions. [2023-11-29 07:08:09,046 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 650 transitions. Word has length 126 [2023-11-29 07:08:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:09,047 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 650 transitions. [2023-11-29 07:08:09,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 650 transitions. [2023-11-29 07:08:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 07:08:09,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:09,049 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:09,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 07:08:09,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:09,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1289567892, now seen corresponding path program 1 times [2023-11-29 07:08:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368875015] [2023-11-29 07:08:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 07:08:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:09,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368875015] [2023-11-29 07:08:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368875015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:09,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454799779] [2023-11-29 07:08:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:09,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:08:09,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:08:09,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:08:09,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:08:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:09,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 07:08:10,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:08:10,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:08:10,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 07:08:10,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-29 07:08:10,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-29 07:08:10,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-29 07:08:10,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-29 07:08:10,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-29 07:08:10,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-11-29 07:08:10,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:08:10,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2023-11-29 07:08:10,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:08:10,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 14 [2023-11-29 07:08:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-11-29 07:08:10,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 07:08:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454799779] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:08:10,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:08:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-11-29 07:08:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082765050] [2023-11-29 07:08:10,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:08:10,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 07:08:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 07:08:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:08:10,806 INFO L87 Difference]: Start difference. First operand 517 states and 650 transitions. Second operand has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-29 07:08:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:11,929 INFO L93 Difference]: Finished difference Result 1053 states and 1303 transitions. [2023-11-29 07:08:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 07:08:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 127 [2023-11-29 07:08:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:11,935 INFO L225 Difference]: With dead ends: 1053 [2023-11-29 07:08:11,935 INFO L226 Difference]: Without dead ends: 537 [2023-11-29 07:08:11,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 276 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2023-11-29 07:08:11,938 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 354 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:11,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 251 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 07:08:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-11-29 07:08:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 521. [2023-11-29 07:08:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 412 states have (on average 1.1577669902912622) internal successors, (477), 418 states have internal predecessors, (477), 79 states have call successors, (79), 29 states have call predecessors, (79), 29 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2023-11-29 07:08:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 635 transitions. [2023-11-29 07:08:12,028 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 635 transitions. Word has length 127 [2023-11-29 07:08:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:12,028 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 635 transitions. [2023-11-29 07:08:12,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-29 07:08:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 635 transitions. [2023-11-29 07:08:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 07:08:12,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:12,031 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:12,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:08:12,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 07:08:12,232 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:12,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1108951021, now seen corresponding path program 1 times [2023-11-29 07:08:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680483201] [2023-11-29 07:08:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680483201] [2023-11-29 07:08:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680483201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026952556] [2023-11-29 07:08:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:12,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:08:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:08:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:08:12,484 INFO L87 Difference]: Start difference. First operand 521 states and 635 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:12,826 INFO L93 Difference]: Finished difference Result 770 states and 932 transitions. [2023-11-29 07:08:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:08:12,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-29 07:08:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:12,830 INFO L225 Difference]: With dead ends: 770 [2023-11-29 07:08:12,830 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 07:08:12,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:12,832 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:12,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 348 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:08:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 07:08:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 248. [2023-11-29 07:08:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 201 states have (on average 1.1293532338308458) internal successors, (227), 203 states have internal predecessors, (227), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 07:08:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2023-11-29 07:08:12,886 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 127 [2023-11-29 07:08:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:12,886 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2023-11-29 07:08:12,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2023-11-29 07:08:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 07:08:12,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:12,888 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:12,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 07:08:12,889 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:12,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1610406102, now seen corresponding path program 1 times [2023-11-29 07:08:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:12,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830288004] [2023-11-29 07:08:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830288004] [2023-11-29 07:08:12,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830288004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:12,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:12,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:08:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920892184] [2023-11-29 07:08:12,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:12,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:12,974 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:13,029 INFO L93 Difference]: Finished difference Result 507 states and 600 transitions. [2023-11-29 07:08:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-29 07:08:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:13,032 INFO L225 Difference]: With dead ends: 507 [2023-11-29 07:08:13,032 INFO L226 Difference]: Without dead ends: 260 [2023-11-29 07:08:13,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:13,034 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:13,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:08:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-29 07:08:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2023-11-29 07:08:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 204 states have (on average 1.1274509803921569) internal successors, (230), 206 states have internal predecessors, (230), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 07:08:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 296 transitions. [2023-11-29 07:08:13,072 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 296 transitions. Word has length 128 [2023-11-29 07:08:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:13,072 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 296 transitions. [2023-11-29 07:08:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 296 transitions. [2023-11-29 07:08:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 07:08:13,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:13,075 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:13,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 07:08:13,075 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:13,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 164601260, now seen corresponding path program 1 times [2023-11-29 07:08:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287341133] [2023-11-29 07:08:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:08:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:08:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:08:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:08:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:08:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:08:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:08:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:08:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:08:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:08:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:08:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:08:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 07:08:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 07:08:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 07:08:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 07:08:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287341133] [2023-11-29 07:08:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287341133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174174610] [2023-11-29 07:08:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:13,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:08:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:08:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:08:13,348 INFO L87 Difference]: Start difference. First operand 251 states and 296 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:13,600 INFO L93 Difference]: Finished difference Result 529 states and 621 transitions. [2023-11-29 07:08:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:08:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-29 07:08:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:13,602 INFO L225 Difference]: With dead ends: 529 [2023-11-29 07:08:13,602 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 07:08:13,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:13,604 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:13,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 323 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:08:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 07:08:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 07:08:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-29 07:08:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 07:08:13,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-11-29 07:08:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:13,606 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 07:08:13,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 07:08:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 07:08:13,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 07:08:13,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 07:08:13,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 07:08:13,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 07:08:15,383 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point L117-21(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point L117-23(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point L117-25(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,383 INFO L899 garLoopResultBuilder]: For program point L117-26(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-27(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-29(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-30(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-31(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-32(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-34(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-35(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-37(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-39(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-41(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,384 INFO L899 garLoopResultBuilder]: For program point L117-43(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,385 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,385 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-11-29 07:08:15,385 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 87) no Hoare annotation was computed. [2023-11-29 07:08:15,385 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,385 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-11-29 07:08:15,385 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,386 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-11-29 07:08:15,386 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-11-29 07:08:15,386 INFO L899 garLoopResultBuilder]: For program point L56-2(lines 56 60) no Hoare annotation was computed. [2023-11-29 07:08:15,386 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-11-29 07:08:15,386 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2023-11-29 07:08:15,387 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse2 (let ((.cse9 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse9 (let ((.cse10 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse9 (* (- 1) .cse10)) 256) 256) .cse10))))) (.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (or (and (<= .cse0 (* (div .cse0 256) 256)) (not (= (select .cse1 (+ |~#WrapperStruct00~0.offset| 2)) (select .cse1 (+ |~#WrapperStruct00~0.offset| 25)))) .cse2) (let ((.cse6 (select .cse1 (+ |~#WrapperStruct00~0.offset| 26)))) (let ((.cse8 (+ .cse6 240))) (let ((.cse4 (+ 112 .cse6)) (.cse7 (select .cse1 (+ 23 |~#WrapperStruct00~0.offset|))) (.cse5 (* 256 (div .cse8 256))) (.cse3 (select .cse1 |~#WrapperStruct00~0.offset|))) (and (<= .cse3 (* (div .cse3 256) 256)) (or (< .cse4 .cse5) (= .cse6 (+ .cse7 16 .cse5))) (or (< .cse6 (+ (* (div .cse4 256) 256) 16)) (= (+ .cse7 .cse5) .cse8)) .cse2 (= .cse0 .cse3)))))))) [2023-11-29 07:08:15,387 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-29 07:08:15,387 INFO L895 garLoopResultBuilder]: At program point L123-2(lines 123 129) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse2 (let ((.cse9 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse9 (let ((.cse10 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse9 (* (- 1) .cse10)) 256) 256) .cse10))))) (.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (or (and (<= .cse0 (* (div .cse0 256) 256)) (not (= (select .cse1 (+ |~#WrapperStruct00~0.offset| 2)) (select .cse1 (+ |~#WrapperStruct00~0.offset| 25)))) .cse2) (let ((.cse6 (select .cse1 (+ |~#WrapperStruct00~0.offset| 26)))) (let ((.cse8 (+ .cse6 240))) (let ((.cse4 (+ 112 .cse6)) (.cse7 (select .cse1 (+ 23 |~#WrapperStruct00~0.offset|))) (.cse5 (* 256 (div .cse8 256))) (.cse3 (select .cse1 |~#WrapperStruct00~0.offset|))) (and (<= .cse3 (* (div .cse3 256) 256)) (or (< .cse4 .cse5) (= .cse6 (+ .cse7 16 .cse5))) (or (< .cse6 (+ (* (div .cse4 256) 256) 16)) (= (+ .cse7 .cse5) .cse8)) .cse2 (= .cse0 .cse3)))))))) [2023-11-29 07:08:15,387 INFO L899 garLoopResultBuilder]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 76) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse2 (let ((.cse9 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse9 (let ((.cse10 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse9 (* (- 1) .cse10)) 256) 256) .cse10))))) (.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (or (and (<= .cse0 (* (div .cse0 256) 256)) (not (= (select .cse1 (+ |~#WrapperStruct00~0.offset| 2)) (select .cse1 (+ |~#WrapperStruct00~0.offset| 25)))) .cse2) (let ((.cse6 (select .cse1 (+ |~#WrapperStruct00~0.offset| 26)))) (let ((.cse8 (+ .cse6 240))) (let ((.cse4 (+ 112 .cse6)) (.cse7 (select .cse1 (+ 23 |~#WrapperStruct00~0.offset|))) (.cse5 (* 256 (div .cse8 256))) (.cse3 (select .cse1 |~#WrapperStruct00~0.offset|))) (and (<= .cse3 (* (div .cse3 256) 256)) (or (< .cse4 .cse5) (= .cse6 (+ .cse7 16 .cse5))) (or (< .cse6 (+ (* (div .cse4 256) 256) 16)) (= (+ .cse7 .cse5) .cse8)) .cse2 (= .cse0 .cse3)))))))) [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-29 07:08:15,388 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L895 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (= |ULTIMATE.start_updateVariables_#t~mem59#1| (select .cse1 (+ |~#WrapperStruct00~0.offset| 28))))) [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 71) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L895 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (= |ULTIMATE.start_updateVariables_#t~mem60#1| (select .cse1 (+ |~#WrapperStruct00~0.offset| 28))))) [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 86) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2023-11-29 07:08:15,389 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point L79-2(lines 79 83) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse2 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse0 (select .cse2 (+ |~#WrapperStruct00~0.offset| 28)))) (< .cse0 (let ((.cse1 (select .cse2 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse0 (* (- 1) .cse1)) 256) 256) .cse1 1))))) [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select .cse0 (+ |~#WrapperStruct00~0.offset| 6))) (let ((.cse1 (select .cse0 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse1 (let ((.cse2 (select .cse0 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse1 (* (- 1) .cse2)) 256) 256) .cse2)))))) [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-29 07:08:15,390 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 70) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L99-7(line 99) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L895 garLoopResultBuilder]: At program point L99-8(line 99) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 69) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 61 71) no Hoare annotation was computed. [2023-11-29 07:08:15,391 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-2(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-3(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-4(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-5(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-6(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-8(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-10(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-12(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-14(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-15(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 (+ |~#WrapperStruct00~0.offset| 6)))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (select .cse1 (+ |~#WrapperStruct00~0.offset| 28)))) (<= .cse2 (let ((.cse3 (select .cse1 (+ |~#WrapperStruct00~0.offset| 27)))) (+ (* (div (+ .cse2 (* (- 1) .cse3)) 256) 256) .cse3)))))) [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-16(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L101-1(line 101) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-17(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,392 INFO L899 garLoopResultBuilder]: For program point L117-19(line 117) no Hoare annotation was computed. [2023-11-29 07:08:15,395 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, 1, 1] [2023-11-29 07:08:15,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:08:15,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated [2023-11-29 07:08:15,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated [2023-11-29 07:08:15,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 2] could not be translated [2023-11-29 07:08:15,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 25] could not be translated [2023-11-29 07:08:15,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-11-29 07:08:15,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-11-29 07:08:15,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-11-29 07:08:15,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-11-29 07:08:15,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated [2023-11-29 07:08:15,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated [2023-11-29 07:08:15,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated [2023-11-29 07:08:15,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated [2023-11-29 07:08:15,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated [2023-11-29 07:08:15,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-11-29 07:08:15,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated [2023-11-29 07:08:15,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-11-29 07:08:15,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated [2023-11-29 07:08:15,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated [2023-11-29 07:08:15,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated [2023-11-29 07:08:15,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:08:15 BoogieIcfgContainer [2023-11-29 07:08:15,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:08:15,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:08:15,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:08:15,424 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:08:15,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:07:51" (3/4) ... [2023-11-29 07:08:15,427 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 07:08:15,432 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 07:08:15,443 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 07:08:15,444 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 07:08:15,446 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 07:08:15,447 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 07:08:15,625 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 07:08:15,625 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 07:08:15,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:08:15,627 INFO L158 Benchmark]: Toolchain (without parser) took 24835.67ms. Allocated memory was 146.8MB in the beginning and 482.3MB in the end (delta: 335.5MB). Free memory was 117.3MB in the beginning and 230.7MB in the end (delta: -113.4MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,627 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:08:15,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.34ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 102.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.46ms. Allocated memory is still 146.8MB. Free memory was 102.4MB in the beginning and 98.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,629 INFO L158 Benchmark]: Boogie Preprocessor took 76.40ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 94.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,629 INFO L158 Benchmark]: RCFGBuilder took 598.31ms. Allocated memory is still 146.8MB. Free memory was 94.7MB in the beginning and 114.6MB in the end (delta: -19.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,629 INFO L158 Benchmark]: TraceAbstraction took 23621.17ms. Allocated memory was 146.8MB in the beginning and 482.3MB in the end (delta: 335.5MB). Free memory was 114.0MB in the beginning and 243.3MB in the end (delta: -129.3MB). Peak memory consumption was 288.2MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,630 INFO L158 Benchmark]: Witness Printer took 201.63ms. Allocated memory is still 482.3MB. Free memory was 243.3MB in the beginning and 230.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 07:08:15,632 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.16ms. Allocated memory is still 113.2MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.34ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 102.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.46ms. Allocated memory is still 146.8MB. Free memory was 102.4MB in the beginning and 98.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.40ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 94.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 598.31ms. Allocated memory is still 146.8MB. Free memory was 94.7MB in the beginning and 114.6MB in the end (delta: -19.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23621.17ms. Allocated memory was 146.8MB in the beginning and 482.3MB in the end (delta: 335.5MB). Free memory was 114.0MB in the beginning and 243.3MB in the end (delta: -129.3MB). Peak memory consumption was 288.2MB. Max. memory is 16.1GB. * Witness Printer took 201.63ms. Allocated memory is still 482.3MB. Free memory was 243.3MB in the beginning and 230.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 25] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][23 + ~#WrapperStruct00~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset + 6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~#WrapperStruct00~0!offset] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2296 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2279 mSDsluCounter, 9109 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6534 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4826 IncrementalHoareTripleChecker+Invalid, 5174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 2575 mSDtfsCounter, 4826 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1001 SyntacticMatches, 11 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=18, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 700 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 632 PreInvPairs, 684 NumberOfFragments, 1404 HoareAnnotationTreeSize, 632 FomulaSimplifications, 224400 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 58405 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 2677 NumberOfCodeBlocks, 2677 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2781 ConstructedInterpolants, 0 QuantifiedInterpolants, 9915 SizeOfPredicates, 7 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 9579/9660 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 07:08:15,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb9978eb-f655-4c6b-a8aa-75003ca8266d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE