./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/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_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/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 32bit --witnessprinter.graph.data.programhash de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:48,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:48,107 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:02:48,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:48,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:48,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:48,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:48,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:48,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:48,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:48,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:48,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:48,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:48,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:48,167 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:48,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:48,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:48,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:48,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:48,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:48,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:48,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:48,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:48,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:48,174 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:48,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:48,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:48,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:48,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:48,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:48,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:48,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:48,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:48,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:48,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:48,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:48,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:48,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:48,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:48,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:48,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:48,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:48,182 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_cbb3c4d9-108f-4c38-b451-1faac764702c/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_cbb3c4d9-108f-4c38-b451-1faac764702c/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d [2024-10-31 22:02:48,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:48,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:48,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:48,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:48,587 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:48,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-10-31 22:02:50,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:51,133 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:51,134 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2024-10-31 22:02:51,147 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/data/37bedff37/a578838dc0634b158ca55a2875092abb/FLAG7c396532e [2024-10-31 22:02:51,472 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/data/37bedff37/a578838dc0634b158ca55a2875092abb [2024-10-31 22:02:51,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:51,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:51,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:51,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:51,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:51,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae014d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51, skipping insertion in model container [2024-10-31 22:02:51,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:51,998 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_cbb3c4d9-108f-4c38-b451-1faac764702c/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2024-10-31 22:02:52,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:52,034 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:52,115 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_cbb3c4d9-108f-4c38-b451-1faac764702c/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2024-10-31 22:02:52,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:52,150 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:52,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52 WrapperNode [2024-10-31 22:02:52,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:52,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:52,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:52,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:52,159 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:02:52" (1/1) ... [2024-10-31 22:02:52,171 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:02:52" (1/1) ... [2024-10-31 22:02:52,222 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 456 [2024-10-31 22:02:52,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:52,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:52,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:52,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:52,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,277 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:02:52,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:52,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:52,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:52,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:52,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (1/1) ... [2024-10-31 22:02:52,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:52,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/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:02:52,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbb3c4d9-108f-4c38-b451-1faac764702c/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:02:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:02:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:52,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:52,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:52,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:53,507 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-31 22:02:53,508 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:53,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:53,546 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:02:53,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:53 BoogieIcfgContainer [2024-10-31 22:02:53,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:53,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:53,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:53,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:53,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:51" (1/3) ... [2024-10-31 22:02:53,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1363d6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:53, skipping insertion in model container [2024-10-31 22:02:53,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:52" (2/3) ... [2024-10-31 22:02:53,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1363d6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:53, skipping insertion in model container [2024-10-31 22:02:53,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:53" (3/3) ... [2024-10-31 22:02:53,563 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2024-10-31 22:02:53,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:53,582 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:02:53,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:53,671 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;@2d412ffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:53,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:02:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.7857142857142858) internal successors, (200), 113 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:02:53,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:53,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:53,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2041770159, now seen corresponding path program 1 times [2024-10-31 22:02:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800284970] [2024-10-31 22:02:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:53,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:54,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800284970] [2024-10-31 22:02:54,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800284970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770458991] [2024-10-31 22:02:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:02:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:54,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:02:54,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:02:54,208 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.7857142857142858) internal successors, (200), 113 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:54,254 INFO L93 Difference]: Finished difference Result 169 states and 291 transitions. [2024-10-31 22:02:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:02:54,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-31 22:02:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:54,273 INFO L225 Difference]: With dead ends: 169 [2024-10-31 22:02:54,273 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:02:54,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:02:54,281 INFO L432 NwaCegarLoop]: 193 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, 193 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:02:54,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:02:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-31 22:02:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 109 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 193 transitions. [2024-10-31 22:02:54,340 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 193 transitions. Word has length 27 [2024-10-31 22:02:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:54,340 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 193 transitions. [2024-10-31 22:02:54,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 193 transitions. [2024-10-31 22:02:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:02:54,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:54,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:54,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:54,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:54,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1822915441, now seen corresponding path program 1 times [2024-10-31 22:02:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:54,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359289695] [2024-10-31 22:02:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359289695] [2024-10-31 22:02:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359289695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778900225] [2024-10-31 22:02:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:54,818 INFO L87 Difference]: Start difference. First operand 110 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:55,009 INFO L93 Difference]: Finished difference Result 168 states and 284 transitions. [2024-10-31 22:02:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:02:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-31 22:02:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:55,011 INFO L225 Difference]: With dead ends: 168 [2024-10-31 22:02:55,012 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:02:55,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:55,014 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:55,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 709 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:02:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:02:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-31 22:02:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2024-10-31 22:02:55,025 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 27 [2024-10-31 22:02:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:55,026 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2024-10-31 22:02:55,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2024-10-31 22:02:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-31 22:02:55,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:55,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:55,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:55,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:55,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2031087693, now seen corresponding path program 1 times [2024-10-31 22:02:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704531321] [2024-10-31 22:02:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:55,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704531321] [2024-10-31 22:02:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704531321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363268649] [2024-10-31 22:02:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:02:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:02:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:55,513 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:56,295 INFO L93 Difference]: Finished difference Result 866 states and 1361 transitions. [2024-10-31 22:02:56,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 22:02:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-31 22:02:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:56,304 INFO L225 Difference]: With dead ends: 866 [2024-10-31 22:02:56,304 INFO L226 Difference]: Without dead ends: 812 [2024-10-31 22:02:56,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-31 22:02:56,309 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1505 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:56,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 3069 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:02:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-31 22:02:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 162. [2024-10-31 22:02:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 161 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 227 transitions. [2024-10-31 22:02:56,350 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 227 transitions. Word has length 76 [2024-10-31 22:02:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:56,351 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 227 transitions. [2024-10-31 22:02:56,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 227 transitions. [2024-10-31 22:02:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 22:02:56,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:56,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:56,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:56,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:56,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash 919155139, now seen corresponding path program 1 times [2024-10-31 22:02:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941349972] [2024-10-31 22:02:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941349972] [2024-10-31 22:02:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941349972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244351779] [2024-10-31 22:02:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:56,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:56,545 INFO L87 Difference]: Start difference. First operand 162 states and 227 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:56,576 INFO L93 Difference]: Finished difference Result 363 states and 550 transitions. [2024-10-31 22:02:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:56,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-31 22:02:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:56,580 INFO L225 Difference]: With dead ends: 363 [2024-10-31 22:02:56,580 INFO L226 Difference]: Without dead ends: 257 [2024-10-31 22:02:56,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:56,585 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:56,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-31 22:02:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-10-31 22:02:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4763779527559056) internal successors, (375), 254 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 375 transitions. [2024-10-31 22:02:56,603 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 375 transitions. Word has length 78 [2024-10-31 22:02:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:56,603 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 375 transitions. [2024-10-31 22:02:56,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 375 transitions. [2024-10-31 22:02:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 22:02:56,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:56,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:56,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:56,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:56,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 985648651, now seen corresponding path program 1 times [2024-10-31 22:02:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488332806] [2024-10-31 22:02:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488332806] [2024-10-31 22:02:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488332806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973292637] [2024-10-31 22:02:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:02:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:02:57,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:57,396 INFO L87 Difference]: Start difference. First operand 255 states and 375 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:57,980 INFO L93 Difference]: Finished difference Result 456 states and 695 transitions. [2024-10-31 22:02:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:02:57,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-31 22:02:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:57,982 INFO L225 Difference]: With dead ends: 456 [2024-10-31 22:02:57,982 INFO L226 Difference]: Without dead ends: 257 [2024-10-31 22:02:57,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:02:57,987 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 180 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:57,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 638 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:02:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-31 22:02:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-10-31 22:02:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.468503937007874) internal successors, (373), 254 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 373 transitions. [2024-10-31 22:02:58,012 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 373 transitions. Word has length 78 [2024-10-31 22:02:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:58,016 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 373 transitions. [2024-10-31 22:02:58,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 373 transitions. [2024-10-31 22:02:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-31 22:02:58,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:58,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:58,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:58,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:58,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash 75614193, now seen corresponding path program 1 times [2024-10-31 22:02:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:58,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552565259] [2024-10-31 22:02:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:58,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552565259] [2024-10-31 22:02:58,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552565259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:02:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676132141] [2024-10-31 22:02:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:02:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:02:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:58,507 INFO L87 Difference]: Start difference. First operand 255 states and 373 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:58,574 INFO L93 Difference]: Finished difference Result 263 states and 382 transitions. [2024-10-31 22:02:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:02:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-31 22:02:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:58,576 INFO L225 Difference]: With dead ends: 263 [2024-10-31 22:02:58,576 INFO L226 Difference]: Without dead ends: 261 [2024-10-31 22:02:58,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:58,577 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:58,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 946 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:02:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-31 22:02:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-10-31 22:02:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.4538461538461538) internal successors, (378), 260 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 378 transitions. [2024-10-31 22:02:58,589 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 378 transitions. Word has length 79 [2024-10-31 22:02:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:58,590 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 378 transitions. [2024-10-31 22:02:58,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 378 transitions. [2024-10-31 22:02:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:58,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:58,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:58,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:58,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 612502699, now seen corresponding path program 1 times [2024-10-31 22:02:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271338257] [2024-10-31 22:02:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:58,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:58,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271338257] [2024-10-31 22:02:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271338257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982533887] [2024-10-31 22:02:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:58,691 INFO L87 Difference]: Start difference. First operand 261 states and 378 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:58,717 INFO L93 Difference]: Finished difference Result 479 states and 719 transitions. [2024-10-31 22:02:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:58,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:02:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:58,719 INFO L225 Difference]: With dead ends: 479 [2024-10-31 22:02:58,719 INFO L226 Difference]: Without dead ends: 367 [2024-10-31 22:02:58,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:58,720 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 77 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:58,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-31 22:02:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-10-31 22:02:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4807692307692308) internal successors, (539), 364 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 539 transitions. [2024-10-31 22:02:58,735 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 539 transitions. Word has length 80 [2024-10-31 22:02:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:58,736 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 539 transitions. [2024-10-31 22:02:58,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 539 transitions. [2024-10-31 22:02:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:58,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:58,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:02:58,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:58,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:58,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1577480533, now seen corresponding path program 1 times [2024-10-31 22:02:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319431248] [2024-10-31 22:02:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:58,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319431248] [2024-10-31 22:02:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319431248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:58,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519006936] [2024-10-31 22:02:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:58,856 INFO L87 Difference]: Start difference. First operand 365 states and 539 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:58,887 INFO L93 Difference]: Finished difference Result 955 states and 1459 transitions. [2024-10-31 22:02:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:02:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:58,891 INFO L225 Difference]: With dead ends: 955 [2024-10-31 22:02:58,891 INFO L226 Difference]: Without dead ends: 648 [2024-10-31 22:02:58,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:58,893 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:58,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-31 22:02:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2024-10-31 22:02:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.5054263565891473) internal successors, (971), 645 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 971 transitions. [2024-10-31 22:02:58,917 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 971 transitions. Word has length 80 [2024-10-31 22:02:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 971 transitions. [2024-10-31 22:02:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 971 transitions. [2024-10-31 22:02:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:58,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:58,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:02:58,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1313624149, now seen corresponding path program 1 times [2024-10-31 22:02:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344003962] [2024-10-31 22:02:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344003962] [2024-10-31 22:02:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344003962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:59,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:59,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:59,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686941483] [2024-10-31 22:02:59,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:59,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:59,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:59,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,020 INFO L87 Difference]: Start difference. First operand 646 states and 971 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:59,072 INFO L93 Difference]: Finished difference Result 1774 states and 2713 transitions. [2024-10-31 22:02:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:02:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:59,079 INFO L225 Difference]: With dead ends: 1774 [2024-10-31 22:02:59,080 INFO L226 Difference]: Without dead ends: 1186 [2024-10-31 22:02:59,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,083 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 71 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:59,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 305 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-10-31 22:02:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2024-10-31 22:02:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.5105663567202028) internal successors, (1787), 1183 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1787 transitions. [2024-10-31 22:02:59,131 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1787 transitions. Word has length 80 [2024-10-31 22:02:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:59,131 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1787 transitions. [2024-10-31 22:02:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1787 transitions. [2024-10-31 22:02:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:59,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:59,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:59,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:02:59,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:59,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2004136363, now seen corresponding path program 1 times [2024-10-31 22:02:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026593108] [2024-10-31 22:02:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026593108] [2024-10-31 22:02:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026593108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:59,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:59,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145591523] [2024-10-31 22:02:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:59,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:59,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:59,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:59,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,234 INFO L87 Difference]: Start difference. First operand 1184 states and 1787 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:59,296 INFO L93 Difference]: Finished difference Result 3340 states and 5077 transitions. [2024-10-31 22:02:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:02:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:59,304 INFO L225 Difference]: With dead ends: 3340 [2024-10-31 22:02:59,304 INFO L226 Difference]: Without dead ends: 2214 [2024-10-31 22:02:59,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,307 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:59,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-10-31 22:02:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2212. [2024-10-31 22:02:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2211 states have (on average 1.5029398462234282) internal successors, (3323), 2211 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3323 transitions. [2024-10-31 22:02:59,405 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3323 transitions. Word has length 80 [2024-10-31 22:02:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:59,406 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 3323 transitions. [2024-10-31 22:02:59,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3323 transitions. [2024-10-31 22:02:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:59,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:59,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:59,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:02:59,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:59,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash -509898069, now seen corresponding path program 1 times [2024-10-31 22:02:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426973145] [2024-10-31 22:02:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:59,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426973145] [2024-10-31 22:02:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426973145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133653111] [2024-10-31 22:02:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:59,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,510 INFO L87 Difference]: Start difference. First operand 2212 states and 3323 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:59,617 INFO L93 Difference]: Finished difference Result 6328 states and 9517 transitions. [2024-10-31 22:02:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:02:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:59,633 INFO L225 Difference]: With dead ends: 6328 [2024-10-31 22:02:59,633 INFO L226 Difference]: Without dead ends: 4174 [2024-10-31 22:02:59,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,639 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 65 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:59,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2024-10-31 22:02:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 4172. [2024-10-31 22:02:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4171 states have (on average 1.4871733397266842) internal successors, (6203), 4171 states have internal predecessors, (6203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 6203 transitions. [2024-10-31 22:02:59,793 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 6203 transitions. Word has length 80 [2024-10-31 22:02:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:59,794 INFO L471 AbstractCegarLoop]: Abstraction has 4172 states and 6203 transitions. [2024-10-31 22:02:59,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 6203 transitions. [2024-10-31 22:02:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:59,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:59,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:02:59,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:59,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -75362133, now seen corresponding path program 1 times [2024-10-31 22:02:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306672960] [2024-10-31 22:02:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:59,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306672960] [2024-10-31 22:02:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306672960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730001949] [2024-10-31 22:02:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:59,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,917 INFO L87 Difference]: Start difference. First operand 4172 states and 6203 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:00,123 INFO L93 Difference]: Finished difference Result 12016 states and 17821 transitions. [2024-10-31 22:03:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:03:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:00,148 INFO L225 Difference]: With dead ends: 12016 [2024-10-31 22:03:00,148 INFO L226 Difference]: Without dead ends: 7902 [2024-10-31 22:03:00,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:00,154 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:00,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 307 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2024-10-31 22:03:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7900. [2024-10-31 22:03:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.4658817571844538) internal successors, (11579), 7899 states have internal predecessors, (11579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11579 transitions. [2024-10-31 22:03:00,501 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11579 transitions. Word has length 80 [2024-10-31 22:03:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:00,501 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 11579 transitions. [2024-10-31 22:03:00,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11579 transitions. [2024-10-31 22:03:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:03:00,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:00,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:00,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:03:00,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:00,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1740395093, now seen corresponding path program 1 times [2024-10-31 22:03:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771104997] [2024-10-31 22:03:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771104997] [2024-10-31 22:03:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771104997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:00,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:00,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485924168] [2024-10-31 22:03:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:00,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:00,604 INFO L87 Difference]: Start difference. First operand 7900 states and 11579 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:01,086 INFO L93 Difference]: Finished difference Result 22816 states and 33277 transitions. [2024-10-31 22:03:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-31 22:03:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:01,150 INFO L225 Difference]: With dead ends: 22816 [2024-10-31 22:03:01,150 INFO L226 Difference]: Without dead ends: 14974 [2024-10-31 22:03:01,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,162 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 75 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:01,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 309 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14974 states. [2024-10-31 22:03:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14974 to 14972. [2024-10-31 22:03:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14972 states, 14971 states have (on average 1.4403179480328636) internal successors, (21563), 14971 states have internal predecessors, (21563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14972 states to 14972 states and 21563 transitions. [2024-10-31 22:03:01,797 INFO L78 Accepts]: Start accepts. Automaton has 14972 states and 21563 transitions. Word has length 80 [2024-10-31 22:03:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:01,798 INFO L471 AbstractCegarLoop]: Abstraction has 14972 states and 21563 transitions. [2024-10-31 22:03:01,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 14972 states and 21563 transitions. [2024-10-31 22:03:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:03:01,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:01,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:01,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:03:01,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:01,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash -751589846, now seen corresponding path program 1 times [2024-10-31 22:03:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701993011] [2024-10-31 22:03:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:03:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701993011] [2024-10-31 22:03:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701993011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:03:02,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675550618] [2024-10-31 22:03:02,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:03:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:03:02,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:02,348 INFO L87 Difference]: Start difference. First operand 14972 states and 21563 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:05,280 INFO L93 Difference]: Finished difference Result 118028 states and 170051 transitions. [2024-10-31 22:03:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:03:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-31 22:03:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:05,666 INFO L225 Difference]: With dead ends: 118028 [2024-10-31 22:03:05,667 INFO L226 Difference]: Without dead ends: 107530 [2024-10-31 22:03:05,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:03:05,735 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 1234 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:05,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1480 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:03:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107530 states. [2024-10-31 22:03:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107530 to 27708. [2024-10-31 22:03:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27708 states, 27707 states have (on average 1.4342584906341358) internal successors, (39739), 27707 states have internal predecessors, (39739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27708 states to 27708 states and 39739 transitions. [2024-10-31 22:03:07,985 INFO L78 Accepts]: Start accepts. Automaton has 27708 states and 39739 transitions. Word has length 103 [2024-10-31 22:03:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:07,986 INFO L471 AbstractCegarLoop]: Abstraction has 27708 states and 39739 transitions. [2024-10-31 22:03:07,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27708 states and 39739 transitions. [2024-10-31 22:03:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:03:07,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:07,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:07,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:03:07,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:07,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1353394218, now seen corresponding path program 1 times [2024-10-31 22:03:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:07,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920950227] [2024-10-31 22:03:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 22:03:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920950227] [2024-10-31 22:03:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920950227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:03:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556162387] [2024-10-31 22:03:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:03:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:03:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:08,551 INFO L87 Difference]: Start difference. First operand 27708 states and 39739 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:11,844 INFO L93 Difference]: Finished difference Result 132940 states and 191427 transitions. [2024-10-31 22:03:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:03:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-31 22:03:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:12,380 INFO L225 Difference]: With dead ends: 132940 [2024-10-31 22:03:12,381 INFO L226 Difference]: Without dead ends: 118026 [2024-10-31 22:03:12,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:03:12,440 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 1298 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:12,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 1557 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:03:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118026 states. [2024-10-31 22:03:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118026 to 47868. [2024-10-31 22:03:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47868 states, 47867 states have (on average 1.4305262498172018) internal successors, (68475), 47867 states have internal predecessors, (68475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47868 states to 47868 states and 68475 transitions. [2024-10-31 22:03:15,382 INFO L78 Accepts]: Start accepts. Automaton has 47868 states and 68475 transitions. Word has length 103 [2024-10-31 22:03:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:15,382 INFO L471 AbstractCegarLoop]: Abstraction has 47868 states and 68475 transitions. [2024-10-31 22:03:15,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 47868 states and 68475 transitions. [2024-10-31 22:03:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:03:15,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:15,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:15,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:03:15,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:15,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1617250602, now seen corresponding path program 1 times [2024-10-31 22:03:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366758198] [2024-10-31 22:03:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-31 22:03:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366758198] [2024-10-31 22:03:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366758198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:03:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477730377] [2024-10-31 22:03:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:03:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:03:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:15,734 INFO L87 Difference]: Start difference. First operand 47868 states and 68475 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)