./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/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_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/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_86d73d1b-a09f-4d53-9166-74706132bc56/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 dffb49b583bf1b2953c0c17a06d6fc63bf48c484ad06befbc2660a12f206f89f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:33:07,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:33:08,051 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:33:08,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:33:08,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:33:08,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:33:08,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:33:08,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:33:08,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:33:08,083 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:33:08,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:33:08,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:33:08,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:33:08,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:33:08,086 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:33:08,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:33:08,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:33:08,088 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:33:08,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:33:08,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:33:08,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:33:08,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:33:08,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:33:08,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:33:08,091 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:33:08,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:33:08,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:33:08,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:33:08,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:33:08,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:33:08,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:33:08,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:33:08,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:33:08,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:33:08,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:33:08,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:33:08,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:33:08,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:33:08,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:33:08,096 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:33:08,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:33:08,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:33:08,104 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_86d73d1b-a09f-4d53-9166-74706132bc56/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_86d73d1b-a09f-4d53-9166-74706132bc56/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 -> dffb49b583bf1b2953c0c17a06d6fc63bf48c484ad06befbc2660a12f206f89f [2023-11-29 02:33:08,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:33:08,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:33:08,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:33:08,364 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:33:08,364 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:33:08,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i [2023-11-29 02:33:11,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:33:11,220 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:33:11,220 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i [2023-11-29 02:33:11,230 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/data/e51cb23b5/50a7d5e906324245b0a76c25e55f2d20/FLAG0d1b375b1 [2023-11-29 02:33:11,246 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/data/e51cb23b5/50a7d5e906324245b0a76c25e55f2d20 [2023-11-29 02:33:11,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:33:11,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:33:11,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:33:11,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:33:11,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:33:11,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69af4722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11, skipping insertion in model container [2023-11-29 02:33:11,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,287 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:33:11,423 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_86d73d1b-a09f-4d53-9166-74706132bc56/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i[915,928] [2023-11-29 02:33:11,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:33:11,495 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:33:11,507 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_86d73d1b-a09f-4d53-9166-74706132bc56/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i[915,928] [2023-11-29 02:33:11,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:33:11,550 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:33:11,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11 WrapperNode [2023-11-29 02:33:11,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:33:11,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:33:11,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:33:11,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:33:11,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,606 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2023-11-29 02:33:11,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:33:11,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:33:11,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:33:11,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:33:11,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:33:11,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:33:11,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:33:11,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:33:11,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:33:11,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (1/1) ... [2023-11-29 02:33:11,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:33:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:33:11,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:33:11,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d73d1b-a09f-4d53-9166-74706132bc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:33:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:33:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:33:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:33:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:33:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:33:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:33:11,821 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:33:11,823 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:33:12,134 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:33:12,162 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:33:12,162 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:33:12,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:33:12 BoogieIcfgContainer [2023-11-29 02:33:12,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:33:12,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:33:12,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:33:12,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:33:12,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:33:11" (1/3) ... [2023-11-29 02:33:12,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba9b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:33:12, skipping insertion in model container [2023-11-29 02:33:12,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:33:11" (2/3) ... [2023-11-29 02:33:12,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba9b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:33:12, skipping insertion in model container [2023-11-29 02:33:12,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:33:12" (3/3) ... [2023-11-29 02:33:12,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-10.i [2023-11-29 02:33:12,192 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:33:12,192 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:33:12,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:33:12,250 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;@3687b680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:33:12,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:33:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 02:33:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 02:33:12,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:12,269 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:33:12,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:33:12,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -379473606, now seen corresponding path program 1 times [2023-11-29 02:33:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:12,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190044577] [2023-11-29 02:33:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:33:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:33:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:33:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:33:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:33:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:33:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:33:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:33:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:33:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:33:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:33:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:33:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:33:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:33:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:33:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:33:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:33:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:33:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:33:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190044577] [2023-11-29 02:33:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190044577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:12,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:33:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788633041] [2023-11-29 02:33:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:12,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:33:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:12,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:33:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:33:12,692 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:33:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:12,728 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2023-11-29 02:33:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:33:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 02:33:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:12,738 INFO L225 Difference]: With dead ends: 125 [2023-11-29 02:33:12,738 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 02:33:12,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 02:33:12,745 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:12,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:33:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 02:33:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 02:33:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 02:33:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2023-11-29 02:33:12,786 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 118 [2023-11-29 02:33:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:12,787 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2023-11-29 02:33:12,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:33:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2023-11-29 02:33:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 02:33:12,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:12,791 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:33:12,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:33:12,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:33:12,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1308844666, now seen corresponding path program 1 times [2023-11-29 02:33:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:12,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685466011] [2023-11-29 02:33:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:33:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:33:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:33:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:33:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:33:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:33:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:33:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:33:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:33:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:33:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:33:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:33:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:33:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:33:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:33:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:33:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:33:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:33:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:33:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685466011] [2023-11-29 02:33:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685466011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:13,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:13,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:33:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073650692] [2023-11-29 02:33:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:13,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:33:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:33:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:33:13,274 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:33:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:13,445 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2023-11-29 02:33:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:33:13,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-29 02:33:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:13,449 INFO L225 Difference]: With dead ends: 185 [2023-11-29 02:33:13,449 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 02:33:13,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:33:13,452 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 92 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:13,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 351 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:33:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 02:33:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2023-11-29 02:33:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:33:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 145 transitions. [2023-11-29 02:33:13,479 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 145 transitions. Word has length 118 [2023-11-29 02:33:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:13,480 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 145 transitions. [2023-11-29 02:33:13,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:33:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 145 transitions. [2023-11-29 02:33:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:33:13,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:13,483 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:33:13,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:33:13,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:33:13,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash -582534747, now seen corresponding path program 1 times [2023-11-29 02:33:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321619478] [2023-11-29 02:33:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:33:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:33:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:33:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:33:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:33:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:33:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:33:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:33:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:33:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:33:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:33:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:33:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:33:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:33:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:33:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:33:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:33:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:33:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:33:20,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:20,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321619478] [2023-11-29 02:33:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321619478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:20,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:33:20,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602313380] [2023-11-29 02:33:20,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:20,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:33:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:33:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:33:20,896 INFO L87 Difference]: Start difference. First operand 95 states and 145 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:33:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:22,580 INFO L93 Difference]: Finished difference Result 287 states and 425 transitions. [2023-11-29 02:33:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 02:33:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 02:33:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:22,584 INFO L225 Difference]: With dead ends: 287 [2023-11-29 02:33:22,584 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 02:33:22,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2023-11-29 02:33:22,587 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:22,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 443 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:33:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 02:33:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 111. [2023-11-29 02:33:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:33:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 170 transitions. [2023-11-29 02:33:22,612 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 170 transitions. Word has length 119 [2023-11-29 02:33:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:22,613 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 170 transitions. [2023-11-29 02:33:22,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:33:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 170 transitions. [2023-11-29 02:33:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:33:22,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:22,616 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:33:22,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:33:22,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:33:22,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1391881373, now seen corresponding path program 1 times [2023-11-29 02:33:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939782096] [2023-11-29 02:33:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:34:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:34:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:34:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:34:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:34:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:34:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:34:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:34:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:34:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:34:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:34:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:34:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:34:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:34:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:34:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:34:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:34:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:34:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:34:49,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939782096] [2023-11-29 02:34:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939782096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:49,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:34:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:34:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157764360] [2023-11-29 02:34:49,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:49,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:34:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:34:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:34:49,824 INFO L87 Difference]: Start difference. First operand 111 states and 170 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:34:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:34:52,913 INFO L93 Difference]: Finished difference Result 292 states and 435 transitions. [2023-11-29 02:34:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:34:52,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 02:34:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:34:52,917 INFO L225 Difference]: With dead ends: 292 [2023-11-29 02:34:52,917 INFO L226 Difference]: Without dead ends: 231 [2023-11-29 02:34:52,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2023-11-29 02:34:52,919 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 353 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:34:52,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 459 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:34:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-29 02:34:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 125. [2023-11-29 02:34:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:34:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2023-11-29 02:34:52,941 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 119 [2023-11-29 02:34:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:34:52,942 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2023-11-29 02:34:52,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:34:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2023-11-29 02:34:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:34:52,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:34:52,945 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:34:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:34:52,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:34:52,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -65381723, now seen corresponding path program 1 times [2023-11-29 02:34:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683269987] [2023-11-29 02:34:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,947 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 216 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:37:27,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:37:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:37:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:37:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:37:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:37:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:37:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:37:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:37:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:37:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:37:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:37:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:37:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:37:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:37:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:37:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:37:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:37:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:37:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:37:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:37:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683269987] [2023-11-29 02:37:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683269987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:37:28,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:37:28,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:37:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690851617] [2023-11-29 02:37:28,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:37:28,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:37:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:37:28,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:37:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:37:28,042 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:37:36,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:37:40,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:37:47,338 WARN L293 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 197 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:37:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:37:47,630 INFO L93 Difference]: Finished difference Result 349 states and 517 transitions. [2023-11-29 02:37:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:37:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 02:37:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:37:47,634 INFO L225 Difference]: With dead ends: 349 [2023-11-29 02:37:47,634 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 02:37:47,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2023-11-29 02:37:47,636 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 445 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 87 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:37:47,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 431 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 626 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 02:37:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 02:37:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 209. [2023-11-29 02:37:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:37:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 309 transitions. [2023-11-29 02:37:47,666 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 309 transitions. Word has length 119 [2023-11-29 02:37:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:37:47,666 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 309 transitions. [2023-11-29 02:37:47,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:37:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 309 transitions. [2023-11-29 02:37:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:37:47,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:37:47,669 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:37:47,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:37:47,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:37:47,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:37:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1623222245, now seen corresponding path program 1 times [2023-11-29 02:37:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:37:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304885249] [2023-11-29 02:37:47,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:37:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:38:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:38:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:38:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:38:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:38:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:38:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:38:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:38:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:38:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:38:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:38:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:38:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:38:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:38:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:38:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:38:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:38:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:38:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:38:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:38:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:38:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304885249] [2023-11-29 02:38:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304885249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:38:42,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:38:42,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:38:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465676065] [2023-11-29 02:38:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:38:42,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:38:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:38:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:38:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:38:42,805 INFO L87 Difference]: Start difference. First operand 209 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:38:49,379 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:38:54,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:38:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:38:54,712 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2023-11-29 02:38:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:38:54,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 02:38:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:38:54,719 INFO L225 Difference]: With dead ends: 421 [2023-11-29 02:38:54,720 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 02:38:54,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2023-11-29 02:38:54,722 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 220 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:38:54,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 521 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 499 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 02:38:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 02:38:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 211. [2023-11-29 02:38:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:38:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2023-11-29 02:38:54,749 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 119 [2023-11-29 02:38:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:38:54,750 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2023-11-29 02:38:54,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:38:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2023-11-29 02:38:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:38:54,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:38:54,755 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:38:54,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:38:54,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:38:54,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:38:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2124084647, now seen corresponding path program 1 times [2023-11-29 02:38:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:38:54,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845378514] [2023-11-29 02:38:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:38:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:38:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:39:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:39:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:39:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:39:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:39:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:39:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:39:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:39:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:39:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:39:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:39:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:39:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:39:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:39:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:39:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:39:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:39:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:39:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:39:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:39:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:39:16,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845378514] [2023-11-29 02:39:16,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845378514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:39:16,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:39:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:39:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319599714] [2023-11-29 02:39:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:39:16,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:39:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:39:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:39:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:39:16,164 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:39:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:39:18,723 INFO L93 Difference]: Finished difference Result 403 states and 592 transitions. [2023-11-29 02:39:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:39:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 02:39:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:39:18,726 INFO L225 Difference]: With dead ends: 403 [2023-11-29 02:39:18,726 INFO L226 Difference]: Without dead ends: 342 [2023-11-29 02:39:18,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2023-11-29 02:39:18,727 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 592 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:39:18,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 508 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:39:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-29 02:39:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 288. [2023-11-29 02:39:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.354368932038835) internal successors, (279), 206 states have internal predecessors, (279), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 02:39:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2023-11-29 02:39:18,754 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 119 [2023-11-29 02:39:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:39:18,755 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2023-11-29 02:39:18,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:39:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2023-11-29 02:39:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:39:18,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:39:18,757 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:39:18,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:39:18,757 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:39:18,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:39:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1314738021, now seen corresponding path program 1 times [2023-11-29 02:39:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:39:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487218571] [2023-11-29 02:39:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:39:18,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:39:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,221 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 214 DAG size of output: 188 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:42:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:42:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:42:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:42:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:42:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:42:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:42:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:42:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:42:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:42:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:42:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:42:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:42:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:42:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:42:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:42:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:42:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:42:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:42:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:42:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:42:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487218571] [2023-11-29 02:42:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487218571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:24,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:24,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:42:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528854435] [2023-11-29 02:42:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:42:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:42:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:42:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:42:24,300 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:42:31,010 WARN L293 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 197 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:42:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:34,002 INFO L93 Difference]: Finished difference Result 570 states and 829 transitions. [2023-11-29 02:42:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 02:42:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 02:42:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:34,006 INFO L225 Difference]: With dead ends: 570 [2023-11-29 02:42:34,006 INFO L226 Difference]: Without dead ends: 509 [2023-11-29 02:42:34,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2023-11-29 02:42:34,008 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 378 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:34,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 572 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 02:42:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-11-29 02:42:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 363. [2023-11-29 02:42:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 260 states have (on average 1.353846153846154) internal successors, (352), 260 states have internal predecessors, (352), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-29 02:42:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 532 transitions. [2023-11-29 02:42:34,044 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 532 transitions. Word has length 119 [2023-11-29 02:42:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:34,044 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 532 transitions. [2023-11-29 02:42:34,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:42:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 532 transitions. [2023-11-29 02:42:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:42:34,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:34,047 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:42:34,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:42:34,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:42:34,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:34,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1653729625, now seen corresponding path program 1 times [2023-11-29 02:42:34,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:42:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407505145] [2023-11-29 02:42:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:42:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,036 WARN L293 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 216 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:45:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:45:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:45:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:45:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:45:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:45:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:45:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:45:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:45:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:45:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:45:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:45:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:45:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:45:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:45:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:45:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:45:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:45:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:45:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:45:19,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:45:19,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407505145] [2023-11-29 02:45:19,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407505145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:45:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:45:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 02:45:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736806059] [2023-11-29 02:45:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:45:19,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:45:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:45:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:45:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:45:19,117 INFO L87 Difference]: Start difference. First operand 363 states and 532 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:45:21,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:31,155 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 206 DAG size of output: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:45:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:45:35,977 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2023-11-29 02:45:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:45:35,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 02:45:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:45:35,980 INFO L225 Difference]: With dead ends: 455 [2023-11-29 02:45:35,980 INFO L226 Difference]: Without dead ends: 394 [2023-11-29 02:45:35,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2023-11-29 02:45:35,981 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 554 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:45:35,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 368 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 02:45:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-29 02:45:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 278. [2023-11-29 02:45:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 196 states have (on average 1.3418367346938775) internal successors, (263), 196 states have internal predecessors, (263), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 02:45:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 407 transitions. [2023-11-29 02:45:36,013 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 407 transitions. Word has length 119 [2023-11-29 02:45:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:45:36,014 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 407 transitions. [2023-11-29 02:45:36,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:45:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 407 transitions. [2023-11-29 02:45:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 02:45:36,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:45:36,016 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:45:36,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:45:36,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:45:36,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:45:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 34874343, now seen corresponding path program 1 times [2023-11-29 02:45:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:45:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903802426] [2023-11-29 02:45:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:45:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:45:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:45:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:45:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:45:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:45:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:45:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:45:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:42,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:45:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:45:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:45:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:45:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:45:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:45:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:45:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:45:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:45:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:45:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:45:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:45:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:45:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903802426] [2023-11-29 02:45:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903802426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:45:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:45:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:45:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587666654] [2023-11-29 02:45:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:45:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:45:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:45:43,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:45:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:45:43,026 INFO L87 Difference]: Start difference. First operand 278 states and 407 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:45:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:45:44,231 INFO L93 Difference]: Finished difference Result 458 states and 668 transitions. [2023-11-29 02:45:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:45:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 02:45:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:45:44,234 INFO L225 Difference]: With dead ends: 458 [2023-11-29 02:45:44,234 INFO L226 Difference]: Without dead ends: 316 [2023-11-29 02:45:44,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:45:44,235 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 159 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:45:44,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 443 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:45:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-29 02:45:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 211. [2023-11-29 02:45:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:45:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2023-11-29 02:45:44,257 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 119 [2023-11-29 02:45:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:45:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2023-11-29 02:45:44,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:45:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2023-11-29 02:45:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 02:45:44,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:45:44,260 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:45:44,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:45:44,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:45:44,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:45:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash 385622693, now seen corresponding path program 1 times [2023-11-29 02:45:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:45:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336873032] [2023-11-29 02:45:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:45:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:46:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:46:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:46:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:46:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:46:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:46:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:46:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:46:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:46:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:46:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:46:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:46:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:46:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 02:46:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 02:46:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:46:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:46:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:46:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:46:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:46:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336873032] [2023-11-29 02:46:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336873032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:46:22,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:46:22,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:46:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782507249] [2023-11-29 02:46:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:46:22,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:46:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:46:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:46:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:46:22,877 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:46:32,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:46:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:35,902 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2023-11-29 02:46:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 02:46:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2023-11-29 02:46:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:35,906 INFO L225 Difference]: With dead ends: 479 [2023-11-29 02:46:35,906 INFO L226 Difference]: Without dead ends: 418 [2023-11-29 02:46:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 02:46:35,908 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 807 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:35,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 504 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 02:46:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-11-29 02:46:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 217. [2023-11-29 02:46:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 156 states have (on average 1.358974358974359) internal successors, (212), 156 states have internal predecessors, (212), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:46:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2023-11-29 02:46:35,924 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 120 [2023-11-29 02:46:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:35,924 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2023-11-29 02:46:35,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:46:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2023-11-29 02:46:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 02:46:35,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:35,925 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:35,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:46:35,925 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:46:35,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1065681063, now seen corresponding path program 1 times [2023-11-29 02:46:35,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:46:35,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813023211] [2023-11-29 02:46:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:46:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat