./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/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_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/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_5bed2f2a-914a-4994-8501-33f4760cea02/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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:59,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:59,129 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:07:59,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:59,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:59,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:59,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:59,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:59,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:07:59,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:07:59,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:59,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:59,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:59,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:59,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:59,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:59,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:07:59,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:59,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:59,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:59,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:59,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:07:59,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:59,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:07:59,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:59,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:59,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:07:59,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:59,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:59,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:59,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:07:59,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:59,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:59,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:59,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:59,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:07:59,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:07:59,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:07:59,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:59,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:59,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:59,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:59,191 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_5bed2f2a-914a-4994-8501-33f4760cea02/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_5bed2f2a-914a-4994-8501-33f4760cea02/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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2024-10-31 22:07:59,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:07:59,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:07:59,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:07:59,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:07:59,544 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:07:59,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/locks/test_locks_13.c Unable to find full path for "g++" [2024-10-31 22:08:01,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:08:01,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:08:01,850 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/sv-benchmarks/c/locks/test_locks_13.c [2024-10-31 22:08:01,864 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/data/283b41ccf/bb3b2c5cef3d45e7b483f5d7aee8d497/FLAGb893eeb8a [2024-10-31 22:08:02,222 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/data/283b41ccf/bb3b2c5cef3d45e7b483f5d7aee8d497 [2024-10-31 22:08:02,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:08:02,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:08:02,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:02,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:08:02,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:08:02,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112a8a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02, skipping insertion in model container [2024-10-31 22:08:02,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:08:02,533 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_5bed2f2a-914a-4994-8501-33f4760cea02/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2024-10-31 22:08:02,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:02,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:08:02,593 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_5bed2f2a-914a-4994-8501-33f4760cea02/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2024-10-31 22:08:02,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:02,620 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:08:02,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02 WrapperNode [2024-10-31 22:08:02,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:02,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:02,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:08:02,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:08:02,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,676 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2024-10-31 22:08:02,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:02,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:08:02,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:08:02,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:08:02,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:08:02,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:08:02,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:08:02,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:08:02,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:08:02,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (1/1) ... [2024-10-31 22:08:02,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:02,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:08:02,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:08:02,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bed2f2a-914a-4994-8501-33f4760cea02/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:08:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:08:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:08:02,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:08:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:08:02,918 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:08:02,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:08:03,300 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-31 22:08:03,300 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:08:03,315 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:08:03,315 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:08:03,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:03 BoogieIcfgContainer [2024-10-31 22:08:03,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:08:03,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:08:03,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:08:03,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:08:03,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:08:02" (1/3) ... [2024-10-31 22:08:03,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d823a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:03, skipping insertion in model container [2024-10-31 22:08:03,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:02" (2/3) ... [2024-10-31 22:08:03,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d823a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:03, skipping insertion in model container [2024-10-31 22:08:03,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:03" (3/3) ... [2024-10-31 22:08:03,331 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2024-10-31 22:08:03,351 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:08:03,351 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:08:03,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:03,436 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;@5a0cdcf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:03,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:08:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 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:08:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:08:03,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:03,453 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] [2024-10-31 22:08:03,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:03,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2024-10-31 22:08:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:03,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699607654] [2024-10-31 22:08:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:03,833 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:08:03,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:03,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699607654] [2024-10-31 22:08:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699607654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:03,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644104878] [2024-10-31 22:08:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:03,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:03,879 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 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 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:08:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:03,937 INFO L93 Difference]: Finished difference Result 99 states and 180 transitions. [2024-10-31 22:08:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:03,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-10-31 22:08:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:03,957 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:08:03,958 INFO L226 Difference]: Without dead ends: 87 [2024-10-31 22:08:03,961 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:08:03,966 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:03,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 173 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-31 22:08:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2024-10-31 22:08:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 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:08:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2024-10-31 22:08:04,032 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2024-10-31 22:08:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,033 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2024-10-31 22:08:04,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:08:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2024-10-31 22:08:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:08:04,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,034 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] [2024-10-31 22:08:04,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:08:04,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2024-10-31 22:08:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648545660] [2024-10-31 22:08:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:04,213 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:08:04,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648545660] [2024-10-31 22:08:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648545660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:04,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:04,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383596578] [2024-10-31 22:08:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:04,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:04,219 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:08:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:04,256 INFO L93 Difference]: Finished difference Result 144 states and 269 transitions. [2024-10-31 22:08:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:04,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-10-31 22:08:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:04,264 INFO L225 Difference]: With dead ends: 144 [2024-10-31 22:08:04,264 INFO L226 Difference]: Without dead ends: 87 [2024-10-31 22:08:04,265 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:08:04,266 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:04,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-31 22:08:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-10-31 22:08:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 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:08:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2024-10-31 22:08:04,283 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2024-10-31 22:08:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,283 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2024-10-31 22:08:04,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:08:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2024-10-31 22:08:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:08:04,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,285 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] [2024-10-31 22:08:04,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:08:04,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2024-10-31 22:08:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795554536] [2024-10-31 22:08:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:04,371 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:08:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795554536] [2024-10-31 22:08:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795554536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:04,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486723223] [2024-10-31 22:08:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:04,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:04,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:04,375 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:04,410 INFO L93 Difference]: Finished difference Result 132 states and 240 transitions. [2024-10-31 22:08:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-31 22:08:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:04,412 INFO L225 Difference]: With dead ends: 132 [2024-10-31 22:08:04,412 INFO L226 Difference]: Without dead ends: 90 [2024-10-31 22:08:04,413 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:08:04,414 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:04,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-31 22:08:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-31 22:08:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 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:08:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2024-10-31 22:08:04,427 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2024-10-31 22:08:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,427 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2024-10-31 22:08:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2024-10-31 22:08:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:08:04,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,429 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] [2024-10-31 22:08:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:08:04,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,431 INFO L85 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2024-10-31 22:08:04,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464884361] [2024-10-31 22:08:04,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:04,537 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:08:04,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464884361] [2024-10-31 22:08:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464884361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:04,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098353096] [2024-10-31 22:08:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:04,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:04,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:04,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:04,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:04,542 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:04,567 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2024-10-31 22:08:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-31 22:08:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:04,570 INFO L225 Difference]: With dead ends: 169 [2024-10-31 22:08:04,570 INFO L226 Difference]: Without dead ends: 167 [2024-10-31 22:08:04,571 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:08:04,572 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:04,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-31 22:08:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2024-10-31 22:08:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 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:08:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2024-10-31 22:08:04,601 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2024-10-31 22:08:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,602 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2024-10-31 22:08:04,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2024-10-31 22:08:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:08:04,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,608 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] [2024-10-31 22:08:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:08:04,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2024-10-31 22:08:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923974670] [2024-10-31 22:08:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:04,691 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:08:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923974670] [2024-10-31 22:08:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923974670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283985081] [2024-10-31 22:08:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:04,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:04,696 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:04,718 INFO L93 Difference]: Finished difference Result 281 states and 515 transitions. [2024-10-31 22:08:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:04,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-31 22:08:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:04,721 INFO L225 Difference]: With dead ends: 281 [2024-10-31 22:08:04,721 INFO L226 Difference]: Without dead ends: 169 [2024-10-31 22:08:04,722 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:08:04,723 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:04,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-31 22:08:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-31 22:08:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 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:08:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2024-10-31 22:08:04,742 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2024-10-31 22:08:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,743 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2024-10-31 22:08:04,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2024-10-31 22:08:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:08:04,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,745 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] [2024-10-31 22:08:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:08:04,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2024-10-31 22:08:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558784236] [2024-10-31 22:08:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:04,794 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:08:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558784236] [2024-10-31 22:08:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558784236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:04,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:04,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48769603] [2024-10-31 22:08:04,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:04,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:04,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:04,798 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:08:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:04,819 INFO L93 Difference]: Finished difference Result 252 states and 454 transitions. [2024-10-31 22:08:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-31 22:08:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:04,821 INFO L225 Difference]: With dead ends: 252 [2024-10-31 22:08:04,822 INFO L226 Difference]: Without dead ends: 171 [2024-10-31 22:08:04,822 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:08:04,824 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:04,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-31 22:08:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-10-31 22:08:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 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:08:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2024-10-31 22:08:04,838 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2024-10-31 22:08:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,838 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2024-10-31 22:08:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:08:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2024-10-31 22:08:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:08:04,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,840 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] [2024-10-31 22:08:04,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:08:04,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2024-10-31 22:08:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129188492] [2024-10-31 22:08:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:04,890 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:08:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129188492] [2024-10-31 22:08:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129188492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:04,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:04,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711531922] [2024-10-31 22:08:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:04,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:04,896 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:08:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:04,931 INFO L93 Difference]: Finished difference Result 489 states and 881 transitions. [2024-10-31 22:08:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-31 22:08:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:04,934 INFO L225 Difference]: With dead ends: 489 [2024-10-31 22:08:04,934 INFO L226 Difference]: Without dead ends: 327 [2024-10-31 22:08:04,935 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:08:04,941 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:04,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-31 22:08:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2024-10-31 22:08:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 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:08:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2024-10-31 22:08:04,984 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2024-10-31 22:08:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:04,984 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2024-10-31 22:08:04,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:08:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2024-10-31 22:08:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:08:04,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:04,987 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] [2024-10-31 22:08:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:08:04,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:04,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2024-10-31 22:08:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550300996] [2024-10-31 22:08:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,049 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:08:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550300996] [2024-10-31 22:08:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550300996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470958130] [2024-10-31 22:08:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,052 INFO L87 Difference]: Start difference. First operand 325 states and 579 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:08:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,084 INFO L93 Difference]: Finished difference Result 417 states and 749 transitions. [2024-10-31 22:08:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-31 22:08:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,087 INFO L225 Difference]: With dead ends: 417 [2024-10-31 22:08:05,087 INFO L226 Difference]: Without dead ends: 415 [2024-10-31 22:08:05,088 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:08:05,089 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-31 22:08:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2024-10-31 22:08:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 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:08:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2024-10-31 22:08:05,114 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2024-10-31 22:08:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,114 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2024-10-31 22:08:05,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:08:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2024-10-31 22:08:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:08:05,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,118 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] [2024-10-31 22:08:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:08:05,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2024-10-31 22:08:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701918108] [2024-10-31 22:08:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,178 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:08:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701918108] [2024-10-31 22:08:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701918108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429885847] [2024-10-31 22:08:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,183 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:08:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,209 INFO L93 Difference]: Finished difference Result 613 states and 1097 transitions. [2024-10-31 22:08:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-31 22:08:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,216 INFO L225 Difference]: With dead ends: 613 [2024-10-31 22:08:05,216 INFO L226 Difference]: Without dead ends: 611 [2024-10-31 22:08:05,217 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:08:05,217 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-10-31 22:08:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2024-10-31 22:08:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 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:08:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2024-10-31 22:08:05,234 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2024-10-31 22:08:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,235 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2024-10-31 22:08:05,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:08:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2024-10-31 22:08:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:08:05,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,241 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] [2024-10-31 22:08:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:08:05,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2024-10-31 22:08:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554926196] [2024-10-31 22:08:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,298 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:08:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554926196] [2024-10-31 22:08:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554926196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426738018] [2024-10-31 22:08:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,300 INFO L87 Difference]: Start difference. First operand 449 states and 783 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:08:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,328 INFO L93 Difference]: Finished difference Result 1077 states and 1889 transitions. [2024-10-31 22:08:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-31 22:08:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,331 INFO L225 Difference]: With dead ends: 1077 [2024-10-31 22:08:05,331 INFO L226 Difference]: Without dead ends: 635 [2024-10-31 22:08:05,332 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:08:05,333 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-31 22:08:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2024-10-31 22:08:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 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:08:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2024-10-31 22:08:05,360 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2024-10-31 22:08:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,361 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2024-10-31 22:08:05,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:08:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2024-10-31 22:08:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:08:05,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,363 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] [2024-10-31 22:08:05,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:08:05,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2024-10-31 22:08:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852445240] [2024-10-31 22:08:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,401 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:08:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852445240] [2024-10-31 22:08:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852445240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145207343] [2024-10-31 22:08:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,405 INFO L87 Difference]: Start difference. First operand 633 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,433 INFO L93 Difference]: Finished difference Result 957 states and 1657 transitions. [2024-10-31 22:08:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-31 22:08:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,437 INFO L225 Difference]: With dead ends: 957 [2024-10-31 22:08:05,437 INFO L226 Difference]: Without dead ends: 647 [2024-10-31 22:08:05,437 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:08:05,439 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-31 22:08:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2024-10-31 22:08:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 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:08:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2024-10-31 22:08:05,462 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2024-10-31 22:08:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2024-10-31 22:08:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2024-10-31 22:08:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:08:05,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,465 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] [2024-10-31 22:08:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:08:05,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2024-10-31 22:08:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582407837] [2024-10-31 22:08:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,509 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:08:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582407837] [2024-10-31 22:08:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582407837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472837724] [2024-10-31 22:08:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,514 INFO L87 Difference]: Start difference. First operand 645 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,549 INFO L93 Difference]: Finished difference Result 1193 states and 2077 transitions. [2024-10-31 22:08:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-31 22:08:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,555 INFO L225 Difference]: With dead ends: 1193 [2024-10-31 22:08:05,558 INFO L226 Difference]: Without dead ends: 1191 [2024-10-31 22:08:05,559 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:08:05,560 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-31 22:08:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2024-10-31 22:08:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 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:08:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2024-10-31 22:08:05,596 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2024-10-31 22:08:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2024-10-31 22:08:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2024-10-31 22:08:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:08:05,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,599 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] [2024-10-31 22:08:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:08:05,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2024-10-31 22:08:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222187275] [2024-10-31 22:08:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,638 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:08:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222187275] [2024-10-31 22:08:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222187275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230111435] [2024-10-31 22:08:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,642 INFO L87 Difference]: Start difference. First operand 901 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,688 INFO L93 Difference]: Finished difference Result 2137 states and 3613 transitions. [2024-10-31 22:08:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-31 22:08:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,694 INFO L225 Difference]: With dead ends: 2137 [2024-10-31 22:08:05,694 INFO L226 Difference]: Without dead ends: 1255 [2024-10-31 22:08:05,695 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:08:05,697 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-10-31 22:08:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2024-10-31 22:08:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 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:08:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2024-10-31 22:08:05,745 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2024-10-31 22:08:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,746 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2024-10-31 22:08:05,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2024-10-31 22:08:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:08:05,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,749 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] [2024-10-31 22:08:05,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:08:05,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2024-10-31 22:08:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129569929] [2024-10-31 22:08:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,787 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:08:05,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129569929] [2024-10-31 22:08:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129569929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130445215] [2024-10-31 22:08:05,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,789 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:08:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,828 INFO L93 Difference]: Finished difference Result 1881 states and 3141 transitions. [2024-10-31 22:08:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-10-31 22:08:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,833 INFO L225 Difference]: With dead ends: 1881 [2024-10-31 22:08:05,833 INFO L226 Difference]: Without dead ends: 1271 [2024-10-31 22:08:05,834 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:08:05,835 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-10-31 22:08:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2024-10-31 22:08:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 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:08:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2024-10-31 22:08:05,890 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2024-10-31 22:08:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:05,891 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2024-10-31 22:08:05,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:08:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2024-10-31 22:08:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:08:05,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:05,893 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] [2024-10-31 22:08:05,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:08:05,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:05,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2024-10-31 22:08:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966835334] [2024-10-31 22:08:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,920 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:08:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966835334] [2024-10-31 22:08:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966835334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:05,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561736088] [2024-10-31 22:08:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,922 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:08:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:05,981 INFO L93 Difference]: Finished difference Result 2313 states and 3893 transitions. [2024-10-31 22:08:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-10-31 22:08:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:05,989 INFO L225 Difference]: With dead ends: 2313 [2024-10-31 22:08:05,989 INFO L226 Difference]: Without dead ends: 2311 [2024-10-31 22:08:05,991 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:08:05,992 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:05,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-31 22:08:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2024-10-31 22:08:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 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:08:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2024-10-31 22:08:06,059 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2024-10-31 22:08:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2024-10-31 22:08:06,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:08:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2024-10-31 22:08:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:08:06,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:06,062 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] [2024-10-31 22:08:06,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:08:06,062 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2024-10-31 22:08:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184256113] [2024-10-31 22:08:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:06,100 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:08:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184256113] [2024-10-31 22:08:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184256113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:06,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:06,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558657381] [2024-10-31 22:08:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:06,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:06,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:06,103 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:08:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:06,168 INFO L93 Difference]: Finished difference Result 4233 states and 6869 transitions. [2024-10-31 22:08:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:06,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-10-31 22:08:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:06,176 INFO L225 Difference]: With dead ends: 4233 [2024-10-31 22:08:06,176 INFO L226 Difference]: Without dead ends: 2471 [2024-10-31 22:08:06,181 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:08:06,181 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:06,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2024-10-31 22:08:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2024-10-31 22:08:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 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:08:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2024-10-31 22:08:06,277 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2024-10-31 22:08:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:06,278 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2024-10-31 22:08:06,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:08:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2024-10-31 22:08:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:08:06,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:06,280 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] [2024-10-31 22:08:06,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:08:06,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:06,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2024-10-31 22:08:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:06,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887006079] [2024-10-31 22:08:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:06,317 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:08:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887006079] [2024-10-31 22:08:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887006079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:06,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667794457] [2024-10-31 22:08:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:06,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:06,319 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:08:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:06,395 INFO L93 Difference]: Finished difference Result 3705 states and 5941 transitions. [2024-10-31 22:08:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-31 22:08:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:06,403 INFO L225 Difference]: With dead ends: 3705 [2024-10-31 22:08:06,403 INFO L226 Difference]: Without dead ends: 2503 [2024-10-31 22:08:06,405 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:08:06,405 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:06,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-10-31 22:08:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2024-10-31 22:08:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 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:08:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2024-10-31 22:08:06,497 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2024-10-31 22:08:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:06,497 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2024-10-31 22:08:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:08:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2024-10-31 22:08:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:08:06,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:06,500 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] [2024-10-31 22:08:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:08:06,501 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2024-10-31 22:08:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753672304] [2024-10-31 22:08:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:06,528 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:08:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753672304] [2024-10-31 22:08:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753672304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:06,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:06,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630385806] [2024-10-31 22:08:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:06,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:06,530 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:08:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:06,639 INFO L93 Difference]: Finished difference Result 4489 states and 7269 transitions. [2024-10-31 22:08:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-31 22:08:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:06,653 INFO L225 Difference]: With dead ends: 4489 [2024-10-31 22:08:06,653 INFO L226 Difference]: Without dead ends: 4487 [2024-10-31 22:08:06,654 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:08:06,655 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2024-10-31 22:08:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2024-10-31 22:08:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 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:08:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2024-10-31 22:08:06,804 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2024-10-31 22:08:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:06,804 INFO L471 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2024-10-31 22:08:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:08:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2024-10-31 22:08:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:08:06,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:06,809 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] [2024-10-31 22:08:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:08:06,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2024-10-31 22:08:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651671728] [2024-10-31 22:08:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:06,834 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:08:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:06,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651671728] [2024-10-31 22:08:06,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651671728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:06,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544205552] [2024-10-31 22:08:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:06,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:06,836 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:08:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:06,971 INFO L93 Difference]: Finished difference Result 8393 states and 13029 transitions. [2024-10-31 22:08:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:06,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-31 22:08:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:06,992 INFO L225 Difference]: With dead ends: 8393 [2024-10-31 22:08:06,992 INFO L226 Difference]: Without dead ends: 4871 [2024-10-31 22:08:06,996 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:08:06,997 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:06,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2024-10-31 22:08:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2024-10-31 22:08:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 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:08:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2024-10-31 22:08:07,245 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2024-10-31 22:08:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:07,246 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2024-10-31 22:08:07,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:08:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2024-10-31 22:08:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:08:07,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:07,252 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:08:07,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:08:07,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:07,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2024-10-31 22:08:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361271876] [2024-10-31 22:08:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:07,285 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:08:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361271876] [2024-10-31 22:08:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361271876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:07,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357701487] [2024-10-31 22:08:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:07,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:07,287 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:07,433 INFO L93 Difference]: Finished difference Result 7305 states and 11205 transitions. [2024-10-31 22:08:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:07,449 INFO L225 Difference]: With dead ends: 7305 [2024-10-31 22:08:07,449 INFO L226 Difference]: Without dead ends: 4935 [2024-10-31 22:08:07,452 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:08:07,453 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:07,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2024-10-31 22:08:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2024-10-31 22:08:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 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:08:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2024-10-31 22:08:07,639 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2024-10-31 22:08:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:07,639 INFO L471 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2024-10-31 22:08:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2024-10-31 22:08:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:08:07,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:07,644 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:08:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:08:07,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2024-10-31 22:08:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744365213] [2024-10-31 22:08:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:07,673 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:08:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744365213] [2024-10-31 22:08:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744365213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:07,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:07,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068724449] [2024-10-31 22:08:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:07,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:07,676 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:07,903 INFO L93 Difference]: Finished difference Result 8713 states and 13509 transitions. [2024-10-31 22:08:07,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:07,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:07,921 INFO L225 Difference]: With dead ends: 8713 [2024-10-31 22:08:07,921 INFO L226 Difference]: Without dead ends: 8711 [2024-10-31 22:08:07,924 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:08:07,925 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:07,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2024-10-31 22:08:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2024-10-31 22:08:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 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:08:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2024-10-31 22:08:08,201 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2024-10-31 22:08:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:08,202 INFO L471 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2024-10-31 22:08:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2024-10-31 22:08:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:08:08,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:08,212 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:08:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:08:08,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2024-10-31 22:08:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:08,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206854687] [2024-10-31 22:08:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:08,249 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:08:08,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:08,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206854687] [2024-10-31 22:08:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206854687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:08,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301744172] [2024-10-31 22:08:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:08,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:08,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:08,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:08,251 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:08,493 INFO L93 Difference]: Finished difference Result 16649 states and 24645 transitions. [2024-10-31 22:08:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:08,514 INFO L225 Difference]: With dead ends: 16649 [2024-10-31 22:08:08,514 INFO L226 Difference]: Without dead ends: 9607 [2024-10-31 22:08:08,522 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:08:08,523 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:08,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2024-10-31 22:08:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2024-10-31 22:08:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 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:08:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2024-10-31 22:08:08,973 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2024-10-31 22:08:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2024-10-31 22:08:08,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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:08:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2024-10-31 22:08:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:08:08,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:08,987 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] [2024-10-31 22:08:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:08:08,987 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2024-10-31 22:08:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570935097] [2024-10-31 22:08:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:09,020 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:08:09,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:09,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570935097] [2024-10-31 22:08:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570935097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132955928] [2024-10-31 22:08:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:09,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:09,023 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:08:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:09,294 INFO L93 Difference]: Finished difference Result 14409 states and 21061 transitions. [2024-10-31 22:08:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-31 22:08:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:09,315 INFO L225 Difference]: With dead ends: 14409 [2024-10-31 22:08:09,316 INFO L226 Difference]: Without dead ends: 9735 [2024-10-31 22:08:09,323 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:08:09,324 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:09,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2024-10-31 22:08:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2024-10-31 22:08:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 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:08:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2024-10-31 22:08:09,742 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2024-10-31 22:08:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:09,742 INFO L471 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2024-10-31 22:08:09,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:08:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2024-10-31 22:08:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:08:09,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:09,751 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] [2024-10-31 22:08:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:08:09,751 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2024-10-31 22:08:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058301439] [2024-10-31 22:08:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:09,774 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:08:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058301439] [2024-10-31 22:08:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058301439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338696300] [2024-10-31 22:08:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:09,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:09,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:09,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:09,777 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:08:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:10,151 INFO L93 Difference]: Finished difference Result 16905 states and 24965 transitions. [2024-10-31 22:08:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-31 22:08:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:10,181 INFO L225 Difference]: With dead ends: 16905 [2024-10-31 22:08:10,181 INFO L226 Difference]: Without dead ends: 16903 [2024-10-31 22:08:10,185 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:08:10,185 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:10,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2024-10-31 22:08:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2024-10-31 22:08:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 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:08:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2024-10-31 22:08:10,624 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2024-10-31 22:08:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:10,624 INFO L471 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2024-10-31 22:08:10,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:08:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2024-10-31 22:08:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:08:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:10,641 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] [2024-10-31 22:08:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:08:10,644 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:10,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1305103377, now seen corresponding path program 1 times [2024-10-31 22:08:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182931573] [2024-10-31 22:08:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:10,685 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:08:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182931573] [2024-10-31 22:08:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182931573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304206952] [2024-10-31 22:08:10,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:10,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:10,687 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:08:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:11,204 INFO L93 Difference]: Finished difference Result 33033 states and 46469 transitions. [2024-10-31 22:08:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-31 22:08:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:11,243 INFO L225 Difference]: With dead ends: 33033 [2024-10-31 22:08:11,244 INFO L226 Difference]: Without dead ends: 18951 [2024-10-31 22:08:11,263 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:08:11,264 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:11,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2024-10-31 22:08:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2024-10-31 22:08:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 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:08:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2024-10-31 22:08:11,968 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2024-10-31 22:08:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:11,968 INFO L471 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2024-10-31 22:08:11,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:08:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2024-10-31 22:08:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:08:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:11,987 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] [2024-10-31 22:08:11,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 22:08:11,987 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash -902905267, now seen corresponding path program 1 times [2024-10-31 22:08:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948810743] [2024-10-31 22:08:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:12,022 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:08:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948810743] [2024-10-31 22:08:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948810743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:12,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496752816] [2024-10-31 22:08:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:12,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:12,024 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:08:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:12,440 INFO L93 Difference]: Finished difference Result 28425 states and 39429 transitions. [2024-10-31 22:08:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-31 22:08:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:12,473 INFO L225 Difference]: With dead ends: 28425 [2024-10-31 22:08:12,473 INFO L226 Difference]: Without dead ends: 19207 [2024-10-31 22:08:12,481 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:08:12,482 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:12,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2024-10-31 22:08:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2024-10-31 22:08:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 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:08:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2024-10-31 22:08:13,066 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2024-10-31 22:08:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:13,066 INFO L471 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2024-10-31 22:08:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:08:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2024-10-31 22:08:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:08:13,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:13,086 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] [2024-10-31 22:08:13,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-31 22:08:13,086 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1803714127, now seen corresponding path program 1 times [2024-10-31 22:08:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726125728] [2024-10-31 22:08:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:13,119 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:08:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726125728] [2024-10-31 22:08:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726125728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117590310] [2024-10-31 22:08:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:13,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:13,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:13,122 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:08:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:13,702 INFO L93 Difference]: Finished difference Result 32777 states and 45829 transitions. [2024-10-31 22:08:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:13,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-31 22:08:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:13,789 INFO L225 Difference]: With dead ends: 32777 [2024-10-31 22:08:13,790 INFO L226 Difference]: Without dead ends: 32775 [2024-10-31 22:08:13,795 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:08:13,796 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:13,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2024-10-31 22:08:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2024-10-31 22:08:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 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:08:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2024-10-31 22:08:14,830 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2024-10-31 22:08:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:14,831 INFO L471 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2024-10-31 22:08:14,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:08:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2024-10-31 22:08:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:08:14,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:14,865 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] [2024-10-31 22:08:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 22:08:14,866 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 782645773, now seen corresponding path program 1 times [2024-10-31 22:08:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48428678] [2024-10-31 22:08:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:14,889 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:08:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48428678] [2024-10-31 22:08:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48428678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026699512] [2024-10-31 22:08:14,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:14,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:14,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:14,891 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:08:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:15,594 INFO L93 Difference]: Finished difference Result 65545 states and 87301 transitions. [2024-10-31 22:08:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-31 22:08:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:15,658 INFO L225 Difference]: With dead ends: 65545 [2024-10-31 22:08:15,658 INFO L226 Difference]: Without dead ends: 37383 [2024-10-31 22:08:15,680 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:08:15,680 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:15,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2024-10-31 22:08:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2024-10-31 22:08:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 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:08:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2024-10-31 22:08:16,559 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2024-10-31 22:08:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:16,560 INFO L471 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2024-10-31 22:08:16,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:08:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2024-10-31 22:08:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:08:16,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:16,583 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] [2024-10-31 22:08:16,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-31 22:08:16,583 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash 80778534, now seen corresponding path program 1 times [2024-10-31 22:08:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274213706] [2024-10-31 22:08:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:16,607 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:08:16,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274213706] [2024-10-31 22:08:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274213706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358615134] [2024-10-31 22:08:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:16,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:16,609 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:08:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:17,509 INFO L93 Difference]: Finished difference Result 56073 states and 73477 transitions. [2024-10-31 22:08:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:17,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-10-31 22:08:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:17,570 INFO L225 Difference]: With dead ends: 56073 [2024-10-31 22:08:17,570 INFO L226 Difference]: Without dead ends: 37895 [2024-10-31 22:08:17,726 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:08:17,727 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:17,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2024-10-31 22:08:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2024-10-31 22:08:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 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:08:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2024-10-31 22:08:18,604 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2024-10-31 22:08:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:18,604 INFO L471 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2024-10-31 22:08:18,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:08:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2024-10-31 22:08:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:08:18,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:18,627 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] [2024-10-31 22:08:18,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-31 22:08:18,628 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1507569368, now seen corresponding path program 1 times [2024-10-31 22:08:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223797639] [2024-10-31 22:08:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:18,657 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:08:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223797639] [2024-10-31 22:08:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223797639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184371373] [2024-10-31 22:08:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:18,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:18,661 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:08:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:19,907 INFO L93 Difference]: Finished difference Result 110601 states and 141317 transitions. [2024-10-31 22:08:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:19,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-10-31 22:08:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:20,011 INFO L225 Difference]: With dead ends: 110601 [2024-10-31 22:08:20,012 INFO L226 Difference]: Without dead ends: 73735 [2024-10-31 22:08:20,052 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:08:20,052 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:20,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2024-10-31 22:08:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2024-10-31 22:08:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2499728747355288) internal successors, (92163), 73732 states have internal predecessors, (92163), 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:08:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 92163 transitions. [2024-10-31 22:08:22,271 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 92163 transitions. Word has length 30 [2024-10-31 22:08:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:22,271 INFO L471 AbstractCegarLoop]: Abstraction has 73733 states and 92163 transitions. [2024-10-31 22:08:22,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:08:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 92163 transitions. [2024-10-31 22:08:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:08:22,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:22,316 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] [2024-10-31 22:08:22,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-31 22:08:22,317 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:22,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash -486501014, now seen corresponding path program 1 times [2024-10-31 22:08:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:22,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761883962] [2024-10-31 22:08:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:22,340 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:08:22,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761883962] [2024-10-31 22:08:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761883962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802029365] [2024-10-31 22:08:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:22,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:22,342 INFO L87 Difference]: Start difference. First operand 73733 states and 92163 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:08:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:24,484 INFO L93 Difference]: Finished difference Result 79881 states and 102405 transitions. [2024-10-31 22:08:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-10-31 22:08:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:24,558 INFO L225 Difference]: With dead ends: 79881 [2024-10-31 22:08:24,559 INFO L226 Difference]: Without dead ends: 79879 [2024-10-31 22:08:24,570 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:08:24,570 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:24,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2024-10-31 22:08:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 73733. [2024-10-31 22:08:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 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:08:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2024-10-31 22:08:26,069 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2024-10-31 22:08:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:26,069 INFO L471 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2024-10-31 22:08:26,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:08:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2024-10-31 22:08:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-31 22:08:26,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:26,328 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] [2024-10-31 22:08:26,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-31 22:08:26,328 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 510205634, now seen corresponding path program 1 times [2024-10-31 22:08:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811667504] [2024-10-31 22:08:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:26,422 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:08:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811667504] [2024-10-31 22:08:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811667504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:26,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427266099] [2024-10-31 22:08:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:26,433 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:08:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:28,424 INFO L93 Difference]: Finished difference Result 121865 states and 151557 transitions. [2024-10-31 22:08:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2024-10-31 22:08:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:28,546 INFO L225 Difference]: With dead ends: 121865 [2024-10-31 22:08:28,546 INFO L226 Difference]: Without dead ends: 121863 [2024-10-31 22:08:28,563 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:08:28,564 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:28,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121863 states. [2024-10-31 22:08:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121863 to 113669. [2024-10-31 22:08:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113669 states, 113668 states have (on average 1.2071911179927508) internal successors, (137219), 113668 states have internal predecessors, (137219), 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:08:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113669 states to 113669 states and 137219 transitions. [2024-10-31 22:08:31,054 INFO L78 Accepts]: Start accepts. Automaton has 113669 states and 137219 transitions. Word has length 31 [2024-10-31 22:08:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:31,054 INFO L471 AbstractCegarLoop]: Abstraction has 113669 states and 137219 transitions. [2024-10-31 22:08:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:08:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 113669 states and 137219 transitions. [2024-10-31 22:08:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-31 22:08:31,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:31,116 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] [2024-10-31 22:08:31,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-31 22:08:31,116 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash -510862720, now seen corresponding path program 1 times [2024-10-31 22:08:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422942579] [2024-10-31 22:08:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:31,139 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:08:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422942579] [2024-10-31 22:08:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422942579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417769693] [2024-10-31 22:08:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:31,142 INFO L87 Difference]: Start difference. First operand 113669 states and 137219 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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)