./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f2704c4e2c6d7f64d9e04a1e2386cc75b096498be0071ea7fbc37af2938bd44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:08:32,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:08:32,528 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-31 22:08:32,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:08:32,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:08:32,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:08:32,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:08:32,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:08:32,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:08:32,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:08:32,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:08:32,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:08:32,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:08:32,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:08:32,580 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:08:32,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:08:32,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:08:32,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:08:32,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:08:32,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:08:32,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:08:32,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:08:32,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:08:32,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:08:32,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:08:32,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:08:32,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:08:32,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:08:32,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:08:32,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:32,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:08:32,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:08:32,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:08:32,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:08:32,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:08:32,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:08:32,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:08:32,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:08:32,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:08:32,594 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_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/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_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f2704c4e2c6d7f64d9e04a1e2386cc75b096498be0071ea7fbc37af2938bd44 [2024-10-31 22:08:32,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:08:32,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:08:32,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:08:32,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:08:32,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:08:32,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c Unable to find full path for "g++" [2024-10-31 22:08:35,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:08:35,572 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:08:35,573 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2024-10-31 22:08:35,590 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/data/82d7b168d/858da121567f4688932d49cba08131d9/FLAG3f9577769 [2024-10-31 22:08:35,855 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/data/82d7b168d/858da121567f4688932d49cba08131d9 [2024-10-31 22:08:35,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:08:35,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:08:35,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:35,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:08:35,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:08:35,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:35" (1/1) ... [2024-10-31 22:08:35,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d462cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:35, skipping insertion in model container [2024-10-31 22:08:35,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:35" (1/1) ... [2024-10-31 22:08:35,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:08:36,207 WARN L251 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_27cd179f-2365-42b3-bd15-f7b33f89a86a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c[1313,1326] [2024-10-31 22:08:36,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:36,578 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:08:36,591 WARN L251 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_27cd179f-2365-42b3-bd15-f7b33f89a86a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c[1313,1326] [2024-10-31 22:08:36,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:36,808 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:08:36,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36 WrapperNode [2024-10-31 22:08:36,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:36,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:36,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:08:36,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:08:36,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:36,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,300 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2366 [2024-10-31 22:08:37,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:37,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:08:37,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:08:37,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:08:37,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,481 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]. [2024-10-31 22:08:37,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:08:37,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:08:37,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:08:37,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:08:37,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (1/1) ... [2024-10-31 22:08:37,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:37,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:08:37,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:08:37,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27cd179f-2365-42b3-bd15-f7b33f89a86a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:08:37,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:08:37,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:08:37,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:08:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:08:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:08:37,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:08:38,016 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:08:38,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:08:42,031 INFO L? ?]: Removed 1210 outVars from TransFormulas that were not future-live. [2024-10-31 22:08:42,031 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:08:42,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:08:42,071 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:08:42,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:42 BoogieIcfgContainer [2024-10-31 22:08:42,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:08:42,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:08:42,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:08:42,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:08:42,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:08:35" (1/3) ... [2024-10-31 22:08:42,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e887cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:42, skipping insertion in model container [2024-10-31 22:08:42,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:36" (2/3) ... [2024-10-31 22:08:42,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e887cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:42, skipping insertion in model container [2024-10-31 22:08:42,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:42" (3/3) ... [2024-10-31 22:08:42,090 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2024-10-31 22:08:42,111 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:08:42,111 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:08:42,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:42,250 INFO L333 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, 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;@713dfcf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:42,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:08:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 812 states, 807 states have (on average 1.503097893432466) internal successors, (1213), 808 states have internal predecessors, (1213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-31 22:08:42,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:42,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:42,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1056094825, now seen corresponding path program 1 times [2024-10-31 22:08:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549618960] [2024-10-31 22:08:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:42,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:08:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549618960] [2024-10-31 22:08:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549618960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:43,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094664680] [2024-10-31 22:08:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:08:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:08:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:08:43,118 INFO L87 Difference]: Start difference. First operand has 812 states, 807 states have (on average 1.503097893432466) internal successors, (1213), 808 states have internal predecessors, (1213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:43,223 INFO L93 Difference]: Finished difference Result 1583 states and 2378 transitions. [2024-10-31 22:08:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:08:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 291 [2024-10-31 22:08:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:43,256 INFO L225 Difference]: With dead ends: 1583 [2024-10-31 22:08:43,257 INFO L226 Difference]: Without dead ends: 809 [2024-10-31 22:08:43,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:08:43,270 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:43,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-10-31 22:08:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2024-10-31 22:08:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 805 states have (on average 1.4956521739130435) internal successors, (1204), 805 states have internal predecessors, (1204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1208 transitions. [2024-10-31 22:08:43,397 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1208 transitions. Word has length 291 [2024-10-31 22:08:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:43,398 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1208 transitions. [2024-10-31 22:08:43,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1208 transitions. [2024-10-31 22:08:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-31 22:08:43,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:43,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:43,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:08:43,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:43,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash -300508269, now seen corresponding path program 1 times [2024-10-31 22:08:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:43,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969735902] [2024-10-31 22:08:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:08:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:45,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969735902] [2024-10-31 22:08:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969735902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:45,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240387959] [2024-10-31 22:08:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:45,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:45,694 INFO L87 Difference]: Start difference. First operand 809 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:45,753 INFO L93 Difference]: Finished difference Result 813 states and 1212 transitions. [2024-10-31 22:08:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:45,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 291 [2024-10-31 22:08:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:45,760 INFO L225 Difference]: With dead ends: 813 [2024-10-31 22:08:45,760 INFO L226 Difference]: Without dead ends: 811 [2024-10-31 22:08:45,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:45,764 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 0 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:45,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3612 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-10-31 22:08:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-10-31 22:08:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 807 states have (on average 1.4944237918215613) internal successors, (1206), 807 states have internal predecessors, (1206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1210 transitions. [2024-10-31 22:08:45,793 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1210 transitions. Word has length 291 [2024-10-31 22:08:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:45,798 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1210 transitions. [2024-10-31 22:08:45,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1210 transitions. [2024-10-31 22:08:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-31 22:08:45,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:45,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:08:45,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -724124799, now seen corresponding path program 1 times [2024-10-31 22:08:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:45,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584449181] [2024-10-31 22:08:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:45,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:08:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584449181] [2024-10-31 22:08:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584449181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:46,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:46,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773394829] [2024-10-31 22:08:46,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:46,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:46,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:46,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:46,970 INFO L87 Difference]: Start difference. First operand 811 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:47,354 INFO L93 Difference]: Finished difference Result 2327 states and 3478 transitions. [2024-10-31 22:08:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:47,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 292 [2024-10-31 22:08:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:47,360 INFO L225 Difference]: With dead ends: 2327 [2024-10-31 22:08:47,361 INFO L226 Difference]: Without dead ends: 811 [2024-10-31 22:08:47,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:08:47,364 INFO L432 NwaCegarLoop]: 1202 mSDtfsCounter, 3110 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 3536 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:47,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3111 Valid, 3536 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:08:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-10-31 22:08:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-10-31 22:08:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 807 states have (on average 1.493184634448575) internal successors, (1205), 807 states have internal predecessors, (1205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1209 transitions. [2024-10-31 22:08:47,387 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1209 transitions. Word has length 292 [2024-10-31 22:08:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:47,388 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1209 transitions. [2024-10-31 22:08:47,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1209 transitions. [2024-10-31 22:08:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-10-31 22:08:47,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:47,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:47,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:08:47,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:47,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -748671506, now seen corresponding path program 1 times [2024-10-31 22:08:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:47,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682577343] [2024-10-31 22:08:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:08:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682577343] [2024-10-31 22:08:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682577343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956131255] [2024-10-31 22:08:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:48,408 INFO L87 Difference]: Start difference. First operand 811 states and 1209 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:48,477 INFO L93 Difference]: Finished difference Result 1586 states and 2365 transitions. [2024-10-31 22:08:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 293 [2024-10-31 22:08:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:48,483 INFO L225 Difference]: With dead ends: 1586 [2024-10-31 22:08:48,483 INFO L226 Difference]: Without dead ends: 813 [2024-10-31 22:08:48,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:48,488 INFO L432 NwaCegarLoop]: 1205 mSDtfsCounter, 0 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3605 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:48,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3605 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-31 22:08:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-10-31 22:08:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.491965389369592) internal successors, (1207), 809 states have internal predecessors, (1207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1211 transitions. [2024-10-31 22:08:48,515 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1211 transitions. Word has length 293 [2024-10-31 22:08:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:48,517 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1211 transitions. [2024-10-31 22:08:48,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1211 transitions. [2024-10-31 22:08:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-31 22:08:48,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:48,523 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:48,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:08:48,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:48,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1463022943, now seen corresponding path program 1 times [2024-10-31 22:08:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020697821] [2024-10-31 22:08:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:08:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020697821] [2024-10-31 22:08:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020697821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:49,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:49,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572853476] [2024-10-31 22:08:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:49,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:49,820 INFO L87 Difference]: Start difference. First operand 813 states and 1211 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:49,917 INFO L93 Difference]: Finished difference Result 1588 states and 2366 transitions. [2024-10-31 22:08:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:49,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 294 [2024-10-31 22:08:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:49,921 INFO L225 Difference]: With dead ends: 1588 [2024-10-31 22:08:49,921 INFO L226 Difference]: Without dead ends: 813 [2024-10-31 22:08:49,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:49,923 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 1162 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:49,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 2384 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-31 22:08:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-10-31 22:08:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.4907292954264524) internal successors, (1206), 809 states have internal predecessors, (1206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1210 transitions. [2024-10-31 22:08:49,942 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1210 transitions. Word has length 294 [2024-10-31 22:08:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1210 transitions. [2024-10-31 22:08:49,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1210 transitions. [2024-10-31 22:08:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-31 22:08:49,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:49,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:49,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:08:49,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1165914221, now seen corresponding path program 1 times [2024-10-31 22:08:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47281616] [2024-10-31 22:08:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:08:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47281616] [2024-10-31 22:08:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47281616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048866506] [2024-10-31 22:08:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:50,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:50,882 INFO L87 Difference]: Start difference. First operand 813 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:50,989 INFO L93 Difference]: Finished difference Result 1588 states and 2364 transitions. [2024-10-31 22:08:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 295 [2024-10-31 22:08:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:51,021 INFO L225 Difference]: With dead ends: 1588 [2024-10-31 22:08:51,021 INFO L226 Difference]: Without dead ends: 813 [2024-10-31 22:08:51,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:51,023 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 1160 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:51,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 2384 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-31 22:08:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-10-31 22:08:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.4894932014833127) internal successors, (1205), 809 states have internal predecessors, (1205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:08:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1209 transitions. [2024-10-31 22:08:51,045 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1209 transitions. Word has length 295 [2024-10-31 22:08:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:51,045 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1209 transitions. [2024-10-31 22:08:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1209 transitions. [2024-10-31 22:08:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-10-31 22:08:51,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:51,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:08:51,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 32960060, now seen corresponding path program 1 times [2024-10-31 22:08:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138285925] [2024-10-31 22:08:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:08:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138285925] [2024-10-31 22:08:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138285925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:52,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:52,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702197686] [2024-10-31 22:08:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:52,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:52,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:52,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:52,319 INFO L87 Difference]: Start difference. First operand 813 states and 1209 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:52,503 INFO L93 Difference]: Finished difference Result 2239 states and 3332 transitions. [2024-10-31 22:08:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 296 [2024-10-31 22:08:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:52,510 INFO L225 Difference]: With dead ends: 2239 [2024-10-31 22:08:52,511 INFO L226 Difference]: Without dead ends: 1464 [2024-10-31 22:08:52,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:52,515 INFO L432 NwaCegarLoop]: 2126 mSDtfsCounter, 941 mSDsluCounter, 5433 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 7559 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:52,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 7559 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2024-10-31 22:08:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 852. [2024-10-31 22:08:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 846 states have (on average 1.4846335697399526) internal successors, (1256), 846 states have internal predecessors, (1256), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-31 22:08:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1264 transitions. [2024-10-31 22:08:52,546 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1264 transitions. Word has length 296 [2024-10-31 22:08:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:52,547 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1264 transitions. [2024-10-31 22:08:52,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1264 transitions. [2024-10-31 22:08:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-31 22:08:52,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:52,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:52,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:08:52,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:52,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1992360579, now seen corresponding path program 1 times [2024-10-31 22:08:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876856242] [2024-10-31 22:08:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-31 22:08:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:08:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876856242] [2024-10-31 22:08:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876856242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:53,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:53,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:08:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9450680] [2024-10-31 22:08:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:53,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:08:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:53,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:08:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:53,838 INFO L87 Difference]: Start difference. First operand 852 states and 1264 transitions. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:54,021 INFO L93 Difference]: Finished difference Result 2317 states and 3442 transitions. [2024-10-31 22:08:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:54,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 297 [2024-10-31 22:08:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:54,029 INFO L225 Difference]: With dead ends: 2317 [2024-10-31 22:08:54,029 INFO L226 Difference]: Without dead ends: 1503 [2024-10-31 22:08:54,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:08:54,031 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 1418 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:54,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 4800 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2024-10-31 22:08:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1355. [2024-10-31 22:08:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1347 states have (on average 1.4870081662954715) internal successors, (2003), 1347 states have internal predecessors, (2003), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 22:08:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2015 transitions. [2024-10-31 22:08:54,071 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2015 transitions. Word has length 297 [2024-10-31 22:08:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:54,072 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2015 transitions. [2024-10-31 22:08:54,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2015 transitions. [2024-10-31 22:08:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-31 22:08:54,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:54,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:54,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:08:54,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2001916055, now seen corresponding path program 1 times [2024-10-31 22:08:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164879585] [2024-10-31 22:08:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:08:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:54,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:54,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164879585] [2024-10-31 22:08:54,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164879585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:54,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:54,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842652275] [2024-10-31 22:08:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:54,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:54,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:54,689 INFO L87 Difference]: Start difference. First operand 1355 states and 2015 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:54,760 INFO L93 Difference]: Finished difference Result 2672 states and 3974 transitions. [2024-10-31 22:08:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 297 [2024-10-31 22:08:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:54,767 INFO L225 Difference]: With dead ends: 2672 [2024-10-31 22:08:54,767 INFO L226 Difference]: Without dead ends: 1355 [2024-10-31 22:08:54,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:54,771 INFO L432 NwaCegarLoop]: 1198 mSDtfsCounter, 1155 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:54,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 2400 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-10-31 22:08:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2024-10-31 22:08:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1347 states have (on average 1.4855233853006682) internal successors, (2001), 1347 states have internal predecessors, (2001), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 22:08:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2013 transitions. [2024-10-31 22:08:54,809 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2013 transitions. Word has length 297 [2024-10-31 22:08:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2013 transitions. [2024-10-31 22:08:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2013 transitions. [2024-10-31 22:08:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-31 22:08:54,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:54,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:54,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:08:54,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:54,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash 257820316, now seen corresponding path program 1 times [2024-10-31 22:08:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425907290] [2024-10-31 22:08:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-31 22:08:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:08:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425907290] [2024-10-31 22:08:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425907290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:08:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83568721] [2024-10-31 22:08:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:56,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:08:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:08:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:08:56,374 INFO L87 Difference]: Start difference. First operand 1355 states and 2013 transitions. Second operand has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:56,605 INFO L93 Difference]: Finished difference Result 2823 states and 4193 transitions. [2024-10-31 22:08:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:08:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2024-10-31 22:08:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:56,613 INFO L225 Difference]: With dead ends: 2823 [2024-10-31 22:08:56,613 INFO L226 Difference]: Without dead ends: 1506 [2024-10-31 22:08:56,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:08:56,616 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 927 mSDsluCounter, 5726 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:56,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 6934 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-10-31 22:08:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1358. [2024-10-31 22:08:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1350 states have (on average 1.4844444444444445) internal successors, (2004), 1350 states have internal predecessors, (2004), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 22:08:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2016 transitions. [2024-10-31 22:08:56,665 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2016 transitions. Word has length 298 [2024-10-31 22:08:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:56,665 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2016 transitions. [2024-10-31 22:08:56,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2016 transitions. [2024-10-31 22:08:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-31 22:08:56,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:56,672 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:08:56,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2118753183, now seen corresponding path program 1 times [2024-10-31 22:08:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666262629] [2024-10-31 22:08:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-31 22:08:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-31 22:08:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:57,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666262629] [2024-10-31 22:08:57,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666262629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:57,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:57,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106049828] [2024-10-31 22:08:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:57,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:57,966 INFO L87 Difference]: Start difference. First operand 1358 states and 2016 transitions. Second operand has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:58,145 INFO L93 Difference]: Finished difference Result 3333 states and 4945 transitions. [2024-10-31 22:08:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2024-10-31 22:08:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:58,152 INFO L225 Difference]: With dead ends: 3333 [2024-10-31 22:08:58,153 INFO L226 Difference]: Without dead ends: 2013 [2024-10-31 22:08:58,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:58,155 INFO L432 NwaCegarLoop]: 1197 mSDtfsCounter, 322 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 4757 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:58,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 4757 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2024-10-31 22:08:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1967. [2024-10-31 22:08:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1953 states have (on average 1.4802867383512546) internal successors, (2891), 1953 states have internal predecessors, (2891), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:08:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2915 transitions. [2024-10-31 22:08:58,256 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2915 transitions. Word has length 298 [2024-10-31 22:08:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2915 transitions. [2024-10-31 22:08:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2915 transitions. [2024-10-31 22:08:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-31 22:08:58,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:58,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:58,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:08:58,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:58,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1116411479, now seen corresponding path program 1 times [2024-10-31 22:08:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571844135] [2024-10-31 22:08:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-31 22:08:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-31 22:08:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:08:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571844135] [2024-10-31 22:08:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571844135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457543372] [2024-10-31 22:08:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:59,150 INFO L87 Difference]: Start difference. First operand 1967 states and 2915 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:59,235 INFO L93 Difference]: Finished difference Result 3287 states and 4875 transitions. [2024-10-31 22:08:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 299 [2024-10-31 22:08:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:59,245 INFO L225 Difference]: With dead ends: 3287 [2024-10-31 22:08:59,248 INFO L226 Difference]: Without dead ends: 1967 [2024-10-31 22:08:59,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:59,254 INFO L432 NwaCegarLoop]: 1198 mSDtfsCounter, 1038 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:59,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2400 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2024-10-31 22:08:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1967. [2024-10-31 22:08:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1953 states have (on average 1.4792626728110598) internal successors, (2889), 1953 states have internal predecessors, (2889), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:08:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2913 transitions. [2024-10-31 22:08:59,350 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2913 transitions. Word has length 299 [2024-10-31 22:08:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:59,350 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2913 transitions. [2024-10-31 22:08:59,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:08:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2913 transitions. [2024-10-31 22:08:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-31 22:08:59,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:59,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:59,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:08:59,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2084295276, now seen corresponding path program 1 times [2024-10-31 22:08:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456540486] [2024-10-31 22:08:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:00,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:09:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:09:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:00,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456540486] [2024-10-31 22:09:00,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456540486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:00,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:00,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:09:00,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225146684] [2024-10-31 22:09:00,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:00,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:09:00,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:00,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:09:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:09:00,888 INFO L87 Difference]: Start difference. First operand 1967 states and 2913 transitions. Second operand has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:09:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:01,067 INFO L93 Difference]: Finished difference Result 3948 states and 5848 transitions. [2024-10-31 22:09:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:09:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 299 [2024-10-31 22:09:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:01,076 INFO L225 Difference]: With dead ends: 3948 [2024-10-31 22:09:01,077 INFO L226 Difference]: Without dead ends: 2628 [2024-10-31 22:09:01,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:09:01,080 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 310 mSDsluCounter, 7866 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 9541 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:01,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 9541 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:09:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2024-10-31 22:09:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2622. [2024-10-31 22:09:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 2602 states have (on average 1.4765564950038432) internal successors, (3842), 2602 states have internal predecessors, (3842), 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) [2024-10-31 22:09:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3878 transitions. [2024-10-31 22:09:01,141 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3878 transitions. Word has length 299 [2024-10-31 22:09:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:01,141 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3878 transitions. [2024-10-31 22:09:01,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:09:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3878 transitions. [2024-10-31 22:09:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-10-31 22:09:01,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:01,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:01,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:09:01,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:01,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -768567748, now seen corresponding path program 1 times [2024-10-31 22:09:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123858166] [2024-10-31 22:09:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms