./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:13:22,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:13:22,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:13:22,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:13:22,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:13:22,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:13:22,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:13:22,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:13:22,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:13:22,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:13:22,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:13:22,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:13:22,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:13:22,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:13:22,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:13:22,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:13:22,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:13:22,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:13:22,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:13:22,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:13:22,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:13:22,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:13:22,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:13:22,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:13:22,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:13:22,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:13:22,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:13:22,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:13:22,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:13:22,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:13:22,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:13:22,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:13:22,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:13:22,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:13:22,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:13:22,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:13:22,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:13:22,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:13:22,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:13:22,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:13:22,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:13:22,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:13:22,209 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c [2024-10-14 05:13:22,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:13:22,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:13:22,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:13:22,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:13:22,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:13:22,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2024-10-14 05:13:23,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:13:24,119 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:13:24,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2024-10-14 05:13:24,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4deaa687c/ff63de6aef7f4ab8826ed855f5f9ce5b/FLAGbbe106855 [2024-10-14 05:13:24,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4deaa687c/ff63de6aef7f4ab8826ed855f5f9ce5b [2024-10-14 05:13:24,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:13:24,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:13:24,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:13:24,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:13:24,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:13:24,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e7d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24, skipping insertion in model container [2024-10-14 05:13:24,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:13:24,401 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[914,927] [2024-10-14 05:13:24,476 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2024-10-14 05:13:24,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:13:24,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:13:24,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[914,927] [2024-10-14 05:13:24,641 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2024-10-14 05:13:24,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:13:24,741 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:13:24,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24 WrapperNode [2024-10-14 05:13:24,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:13:24,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:13:24,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:13:24,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:13:24,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,829 INFO L138 Inliner]: procedures = 77, calls = 93, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1068 [2024-10-14 05:13:24,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:13:24,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:13:24,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:13:24,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:13:24,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,868 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-14 05:13:24,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:13:24,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:13:24,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:13:24,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:13:24,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (1/1) ... [2024-10-14 05:13:24,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:13:24,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:24,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:13:24,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:13:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:13:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:13:25,047 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:13:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:13:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:13:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:13:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:13:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:13:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:13:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:13:25,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:13:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:13:25,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:13:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:13:25,050 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:13:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:13:25,051 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:13:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:13:25,051 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:13:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:13:25,052 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:13:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:13:25,052 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:13:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:13:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:13:25,053 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:13:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:13:25,054 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:13:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:13:25,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:13:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:13:25,055 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:13:25,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:13:25,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:13:26,368 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-14 05:13:26,369 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:13:26,450 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:13:26,454 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-14 05:13:26,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:26 BoogieIcfgContainer [2024-10-14 05:13:26,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:13:26,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:13:26,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:13:26,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:13:26,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:13:24" (1/3) ... [2024-10-14 05:13:26,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d80c83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:26, skipping insertion in model container [2024-10-14 05:13:26,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:24" (2/3) ... [2024-10-14 05:13:26,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d80c83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:26, skipping insertion in model container [2024-10-14 05:13:26,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:26" (3/3) ... [2024-10-14 05:13:26,464 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2024-10-14 05:13:26,480 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:13:26,480 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:13:26,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:13:26,581 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;@f818a05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:13:26,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:13:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 439 states, 382 states have (on average 1.7146596858638743) internal successors, (655), 388 states have internal predecessors, (655), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 05:13:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:26,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:26,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:26,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:26,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 204893055, now seen corresponding path program 1 times [2024-10-14 05:13:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679453886] [2024-10-14 05:13:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,260 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-14 05:13:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:27,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679453886] [2024-10-14 05:13:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679453886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:27,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:27,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569499057] [2024-10-14 05:13:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:27,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:27,301 INFO L87 Difference]: Start difference. First operand has 439 states, 382 states have (on average 1.7146596858638743) internal successors, (655), 388 states have internal predecessors, (655), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:28,865 INFO L93 Difference]: Finished difference Result 978 states and 1621 transitions. [2024-10-14 05:13:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:13:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:28,891 INFO L225 Difference]: With dead ends: 978 [2024-10-14 05:13:28,892 INFO L226 Difference]: Without dead ends: 559 [2024-10-14 05:13:28,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:28,903 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1483 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:28,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1488 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:13:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-14 05:13:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 522. [2024-10-14 05:13:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 447 states have (on average 1.58165548098434) internal successors, (707), 453 states have internal predecessors, (707), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-10-14 05:13:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 812 transitions. [2024-10-14 05:13:29,023 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 812 transitions. Word has length 58 [2024-10-14 05:13:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:29,024 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 812 transitions. [2024-10-14 05:13:29,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 812 transitions. [2024-10-14 05:13:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:29,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:29,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:29,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:13:29,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash -886268992, now seen corresponding path program 1 times [2024-10-14 05:13:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417670297] [2024-10-14 05:13:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,245 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-14 05:13:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417670297] [2024-10-14 05:13:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417670297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:29,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:29,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372963573] [2024-10-14 05:13:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:29,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:29,253 INFO L87 Difference]: Start difference. First operand 522 states and 812 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:30,746 INFO L93 Difference]: Finished difference Result 842 states and 1262 transitions. [2024-10-14 05:13:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:13:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:13:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:30,752 INFO L225 Difference]: With dead ends: 842 [2024-10-14 05:13:30,753 INFO L226 Difference]: Without dead ends: 680 [2024-10-14 05:13:30,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:13:30,755 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1711 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:30,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1673 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:13:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-14 05:13:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 610. [2024-10-14 05:13:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 515 states have (on average 1.5592233009708738) internal successors, (803), 523 states have internal predecessors, (803), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-14 05:13:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 938 transitions. [2024-10-14 05:13:30,810 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 938 transitions. Word has length 58 [2024-10-14 05:13:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:30,810 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 938 transitions. [2024-10-14 05:13:30,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 938 transitions. [2024-10-14 05:13:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:30,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:30,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:13:30,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1042003710, now seen corresponding path program 1 times [2024-10-14 05:13:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:30,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26543087] [2024-10-14 05:13:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:30,999 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-14 05:13:31,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:31,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26543087] [2024-10-14 05:13:31,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26543087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:31,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:31,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:31,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653294453] [2024-10-14 05:13:31,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:31,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:31,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:31,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:31,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:31,003 INFO L87 Difference]: Start difference. First operand 610 states and 938 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:32,372 INFO L93 Difference]: Finished difference Result 884 states and 1324 transitions. [2024-10-14 05:13:32,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 05:13:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:32,377 INFO L225 Difference]: With dead ends: 884 [2024-10-14 05:13:32,377 INFO L226 Difference]: Without dead ends: 640 [2024-10-14 05:13:32,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:32,379 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 910 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:32,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2138 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:13:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-14 05:13:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 614. [2024-10-14 05:13:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 518 states have (on average 1.5521235521235521) internal successors, (804), 526 states have internal predecessors, (804), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2024-10-14 05:13:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 940 transitions. [2024-10-14 05:13:32,414 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 940 transitions. Word has length 58 [2024-10-14 05:13:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:32,415 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 940 transitions. [2024-10-14 05:13:32,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 940 transitions. [2024-10-14 05:13:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:32,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:32,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:32,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:13:32,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:32,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1201979588, now seen corresponding path program 1 times [2024-10-14 05:13:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242587718] [2024-10-14 05:13:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:32,590 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-14 05:13:32,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242587718] [2024-10-14 05:13:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242587718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:32,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:32,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:13:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350696663] [2024-10-14 05:13:32,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:32,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:13:32,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:13:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:32,593 INFO L87 Difference]: Start difference. First operand 614 states and 940 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 05:13:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:34,524 INFO L93 Difference]: Finished difference Result 1838 states and 2638 transitions. [2024-10-14 05:13:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:13:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-14 05:13:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:34,532 INFO L225 Difference]: With dead ends: 1838 [2024-10-14 05:13:34,532 INFO L226 Difference]: Without dead ends: 1572 [2024-10-14 05:13:34,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 05:13:34,535 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 3437 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3451 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:34,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3451 Valid, 2215 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:13:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-10-14 05:13:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1449. [2024-10-14 05:13:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1167 states have (on average 1.437017994858612) internal successors, (1677), 1190 states have internal predecessors, (1677), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2024-10-14 05:13:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2015 transitions. [2024-10-14 05:13:34,655 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2015 transitions. Word has length 58 [2024-10-14 05:13:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:34,657 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2015 transitions. [2024-10-14 05:13:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 05:13:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2015 transitions. [2024-10-14 05:13:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:34,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:34,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:13:34,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash 424762129, now seen corresponding path program 1 times [2024-10-14 05:13:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973630592] [2024-10-14 05:13:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:34,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-14 05:13:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973630592] [2024-10-14 05:13:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973630592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:34,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489669508] [2024-10-14 05:13:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:34,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:34,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:34,836 INFO L87 Difference]: Start difference. First operand 1449 states and 2015 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:36,234 INFO L93 Difference]: Finished difference Result 2638 states and 3586 transitions. [2024-10-14 05:13:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:13:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 05:13:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:36,244 INFO L225 Difference]: With dead ends: 2638 [2024-10-14 05:13:36,244 INFO L226 Difference]: Without dead ends: 1543 [2024-10-14 05:13:36,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:36,251 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 614 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:36,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2408 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:13:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-10-14 05:13:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1473. [2024-10-14 05:13:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1185 states have (on average 1.4236286919831223) internal successors, (1687), 1208 states have internal predecessors, (1687), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2024-10-14 05:13:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2031 transitions. [2024-10-14 05:13:36,345 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2031 transitions. Word has length 59 [2024-10-14 05:13:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:36,346 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 2031 transitions. [2024-10-14 05:13:36,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2031 transitions. [2024-10-14 05:13:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:36,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:36,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:13:36,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:13:36,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1946977133, now seen corresponding path program 1 times [2024-10-14 05:13:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978168102] [2024-10-14 05:13:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:36,531 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-14 05:13:36,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978168102] [2024-10-14 05:13:36,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978168102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:36,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:36,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:36,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970323760] [2024-10-14 05:13:36,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:36,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:36,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:36,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:36,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:36,534 INFO L87 Difference]: Start difference. First operand 1473 states and 2031 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:37,927 INFO L93 Difference]: Finished difference Result 2623 states and 3473 transitions. [2024-10-14 05:13:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:13:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-14 05:13:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:37,937 INFO L225 Difference]: With dead ends: 2623 [2024-10-14 05:13:37,937 INFO L226 Difference]: Without dead ends: 1711 [2024-10-14 05:13:37,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:13:37,941 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1351 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:37,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1750 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-14 05:13:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1418. [2024-10-14 05:13:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1146 states have (on average 1.4214659685863875) internal successors, (1629), 1164 states have internal predecessors, (1629), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2024-10-14 05:13:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1952 transitions. [2024-10-14 05:13:38,054 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1952 transitions. Word has length 59 [2024-10-14 05:13:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1952 transitions. [2024-10-14 05:13:38,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1952 transitions. [2024-10-14 05:13:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:38,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:38,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:13:38,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1728122415, now seen corresponding path program 1 times [2024-10-14 05:13:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237052175] [2024-10-14 05:13:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:38,189 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-14 05:13:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237052175] [2024-10-14 05:13:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237052175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764843480] [2024-10-14 05:13:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:38,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:38,193 INFO L87 Difference]: Start difference. First operand 1418 states and 1952 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:39,162 INFO L93 Difference]: Finished difference Result 3567 states and 4723 transitions. [2024-10-14 05:13:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:13:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-14 05:13:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:39,176 INFO L225 Difference]: With dead ends: 3567 [2024-10-14 05:13:39,177 INFO L226 Difference]: Without dead ends: 2504 [2024-10-14 05:13:39,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:39,182 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1662 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:39,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 1180 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-10-14 05:13:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2388. [2024-10-14 05:13:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 1873 states have (on average 1.3497063534436733) internal successors, (2528), 1908 states have internal predecessors, (2528), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2024-10-14 05:13:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3161 transitions. [2024-10-14 05:13:39,436 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3161 transitions. Word has length 59 [2024-10-14 05:13:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:39,436 INFO L471 AbstractCegarLoop]: Abstraction has 2388 states and 3161 transitions. [2024-10-14 05:13:39,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3161 transitions. [2024-10-14 05:13:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:13:39,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:39,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:39,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:13:39,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:39,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1349667701, now seen corresponding path program 1 times [2024-10-14 05:13:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:39,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898290301] [2024-10-14 05:13:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:39,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,524 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-14 05:13:39,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898290301] [2024-10-14 05:13:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898290301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015292272] [2024-10-14 05:13:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:39,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:39,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:39,527 INFO L87 Difference]: Start difference. First operand 2388 states and 3161 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:40,479 INFO L93 Difference]: Finished difference Result 5440 states and 7042 transitions. [2024-10-14 05:13:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-14 05:13:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:40,501 INFO L225 Difference]: With dead ends: 5440 [2024-10-14 05:13:40,502 INFO L226 Difference]: Without dead ends: 3412 [2024-10-14 05:13:40,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:40,509 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1124 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:40,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1179 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-10-14 05:13:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3154. [2024-10-14 05:13:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 2453 states have (on average 1.326946596004892) internal successors, (3255), 2493 states have internal predecessors, (3255), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2024-10-14 05:13:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4094 transitions. [2024-10-14 05:13:40,795 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4094 transitions. Word has length 60 [2024-10-14 05:13:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:40,796 INFO L471 AbstractCegarLoop]: Abstraction has 3154 states and 4094 transitions. [2024-10-14 05:13:40,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4094 transitions. [2024-10-14 05:13:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 05:13:40,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:40,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:13:40,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1520239242, now seen corresponding path program 1 times [2024-10-14 05:13:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:40,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041870113] [2024-10-14 05:13:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:40,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:40,872 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-14 05:13:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041870113] [2024-10-14 05:13:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041870113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134815214] [2024-10-14 05:13:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:40,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:40,875 INFO L87 Difference]: Start difference. First operand 3154 states and 4094 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:41,729 INFO L93 Difference]: Finished difference Result 6718 states and 8560 transitions. [2024-10-14 05:13:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-14 05:13:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:41,757 INFO L225 Difference]: With dead ends: 6718 [2024-10-14 05:13:41,758 INFO L226 Difference]: Without dead ends: 3922 [2024-10-14 05:13:41,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:41,766 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1628 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:41,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 959 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2024-10-14 05:13:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3658. [2024-10-14 05:13:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2843 states have (on average 1.3172704889201547) internal successors, (3745), 2887 states have internal predecessors, (3745), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2024-10-14 05:13:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4713 transitions. [2024-10-14 05:13:42,067 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4713 transitions. Word has length 66 [2024-10-14 05:13:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:42,067 INFO L471 AbstractCegarLoop]: Abstraction has 3658 states and 4713 transitions. [2024-10-14 05:13:42,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4713 transitions. [2024-10-14 05:13:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 05:13:42,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:42,069 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:13:42,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -634166033, now seen corresponding path program 1 times [2024-10-14 05:13:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424580787] [2024-10-14 05:13:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424580787] [2024-10-14 05:13:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424580787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:42,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:42,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:42,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137034113] [2024-10-14 05:13:42,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:42,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:42,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:42,201 INFO L87 Difference]: Start difference. First operand 3658 states and 4713 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:43,143 INFO L93 Difference]: Finished difference Result 4666 states and 5930 transitions. [2024-10-14 05:13:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:13:43,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-14 05:13:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:43,166 INFO L225 Difference]: With dead ends: 4666 [2024-10-14 05:13:43,166 INFO L226 Difference]: Without dead ends: 4663 [2024-10-14 05:13:43,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:43,169 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2274 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:43,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 935 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2024-10-14 05:13:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4078. [2024-10-14 05:13:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4078 states, 3156 states have (on average 1.3051330798479088) internal successors, (4119), 3203 states have internal predecessors, (4119), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2024-10-14 05:13:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 5214 transitions. [2024-10-14 05:13:43,525 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 5214 transitions. Word has length 67 [2024-10-14 05:13:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:43,526 INFO L471 AbstractCegarLoop]: Abstraction has 4078 states and 5214 transitions. [2024-10-14 05:13:43,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 5214 transitions. [2024-10-14 05:13:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 05:13:43,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:43,528 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:43,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:13:43,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1814243188, now seen corresponding path program 1 times [2024-10-14 05:13:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067131230] [2024-10-14 05:13:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:43,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067131230] [2024-10-14 05:13:43,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067131230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701514406] [2024-10-14 05:13:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:43,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:43,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:43,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:13:43,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:13:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:13:43,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:44,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:13:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701514406] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:13:44,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:13:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-14 05:13:44,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959085069] [2024-10-14 05:13:44,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:13:44,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:13:44,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:44,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:13:44,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:44,256 INFO L87 Difference]: Start difference. First operand 4078 states and 5214 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:13:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:46,381 INFO L93 Difference]: Finished difference Result 8050 states and 10077 transitions. [2024-10-14 05:13:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 05:13:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-14 05:13:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:46,415 INFO L225 Difference]: With dead ends: 8050 [2024-10-14 05:13:46,415 INFO L226 Difference]: Without dead ends: 8047 [2024-10-14 05:13:46,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2024-10-14 05:13:46,420 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 2368 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:46,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 2048 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:13:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8047 states. [2024-10-14 05:13:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8047 to 7195. [2024-10-14 05:13:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7195 states, 5531 states have (on average 1.2840354366299043) internal successors, (7102), 5613 states have internal predecessors, (7102), 820 states have call successors, (820), 693 states have call predecessors, (820), 842 states have return successors, (1135), 891 states have call predecessors, (1135), 819 states have call successors, (1135) [2024-10-14 05:13:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 9057 transitions. [2024-10-14 05:13:47,246 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 9057 transitions. Word has length 68 [2024-10-14 05:13:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:47,247 INFO L471 AbstractCegarLoop]: Abstraction has 7195 states and 9057 transitions. [2024-10-14 05:13:47,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:13:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 9057 transitions. [2024-10-14 05:13:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:13:47,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:47,249 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:47,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 05:13:47,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 05:13:47,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1384081233, now seen corresponding path program 2 times [2024-10-14 05:13:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348583232] [2024-10-14 05:13:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:47,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348583232] [2024-10-14 05:13:47,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348583232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:47,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:47,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:47,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904794955] [2024-10-14 05:13:47,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:47,538 INFO L87 Difference]: Start difference. First operand 7195 states and 9057 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:48,667 INFO L93 Difference]: Finished difference Result 9583 states and 12060 transitions. [2024-10-14 05:13:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:13:48,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-14 05:13:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:48,687 INFO L225 Difference]: With dead ends: 9583 [2024-10-14 05:13:48,688 INFO L226 Difference]: Without dead ends: 3945 [2024-10-14 05:13:48,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:48,701 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1545 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:48,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 990 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2024-10-14 05:13:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3009. [2024-10-14 05:13:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2351 states have (on average 1.2994470438111443) internal successors, (3055), 2379 states have internal predecessors, (3055), 339 states have call successors, (339), 275 states have call predecessors, (339), 317 states have return successors, (434), 357 states have call predecessors, (434), 338 states have call successors, (434) [2024-10-14 05:13:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 3828 transitions. [2024-10-14 05:13:49,033 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 3828 transitions. Word has length 71 [2024-10-14 05:13:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:49,034 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 3828 transitions. [2024-10-14 05:13:49,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 3828 transitions. [2024-10-14 05:13:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:13:49,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:49,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:13:49,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:49,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1923995982, now seen corresponding path program 1 times [2024-10-14 05:13:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722746940] [2024-10-14 05:13:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:13:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722746940] [2024-10-14 05:13:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722746940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804519436] [2024-10-14 05:13:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:49,157 INFO L87 Difference]: Start difference. First operand 3009 states and 3828 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:50,761 INFO L93 Difference]: Finished difference Result 8327 states and 10359 transitions. [2024-10-14 05:13:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 05:13:50,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-14 05:13:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:50,783 INFO L225 Difference]: With dead ends: 8327 [2024-10-14 05:13:50,783 INFO L226 Difference]: Without dead ends: 4937 [2024-10-14 05:13:50,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-14 05:13:50,792 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1429 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:50,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 1553 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2024-10-14 05:13:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4677. [2024-10-14 05:13:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4677 states, 3584 states have (on average 1.2575334821428572) internal successors, (4507), 3649 states have internal predecessors, (4507), 539 states have call successors, (539), 447 states have call predecessors, (539), 552 states have return successors, (784), 583 states have call predecessors, (784), 538 states have call successors, (784) [2024-10-14 05:13:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 5830 transitions. [2024-10-14 05:13:51,269 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 5830 transitions. Word has length 76 [2024-10-14 05:13:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:51,269 INFO L471 AbstractCegarLoop]: Abstraction has 4677 states and 5830 transitions. [2024-10-14 05:13:51,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 5830 transitions. [2024-10-14 05:13:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 05:13:51,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:51,272 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:51,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:13:51,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:51,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1804284816, now seen corresponding path program 1 times [2024-10-14 05:13:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651250156] [2024-10-14 05:13:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 05:13:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:13:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651250156] [2024-10-14 05:13:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651250156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:51,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:51,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:51,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88637784] [2024-10-14 05:13:51,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:51,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:51,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:51,409 INFO L87 Difference]: Start difference. First operand 4677 states and 5830 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:53,202 INFO L93 Difference]: Finished difference Result 7767 states and 9578 transitions. [2024-10-14 05:13:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 05:13:53,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-14 05:13:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:53,223 INFO L225 Difference]: With dead ends: 7767 [2024-10-14 05:13:53,223 INFO L226 Difference]: Without dead ends: 3924 [2024-10-14 05:13:53,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-14 05:13:53,235 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 2227 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:53,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 1542 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2024-10-14 05:13:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3520. [2024-10-14 05:13:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2693 states have (on average 1.2491645005569996) internal successors, (3364), 2746 states have internal predecessors, (3364), 404 states have call successors, (404), 329 states have call predecessors, (404), 421 states have return successors, (553), 447 states have call predecessors, (553), 403 states have call successors, (553) [2024-10-14 05:13:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4321 transitions. [2024-10-14 05:13:53,858 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4321 transitions. Word has length 86 [2024-10-14 05:13:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:53,859 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4321 transitions. [2024-10-14 05:13:53,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4321 transitions. [2024-10-14 05:13:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:13:53,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:53,862 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:53,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:13:53,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:53,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1449862396, now seen corresponding path program 1 times [2024-10-14 05:13:53,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:53,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993112121] [2024-10-14 05:13:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:13:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 05:13:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 05:13:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 05:13:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:13:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 05:13:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-14 05:13:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993112121] [2024-10-14 05:13:54,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993112121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228539712] [2024-10-14 05:13:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:54,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:54,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:13:54,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:13:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:13:54,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 05:13:54,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:13:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228539712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:54,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:13:54,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-14 05:13:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741620494] [2024-10-14 05:13:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:54,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:54,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:54,213 INFO L87 Difference]: Start difference. First operand 3520 states and 4321 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:13:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:54,524 INFO L93 Difference]: Finished difference Result 5111 states and 6229 transitions. [2024-10-14 05:13:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:13:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-14 05:13:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:54,532 INFO L225 Difference]: With dead ends: 5111 [2024-10-14 05:13:54,532 INFO L226 Difference]: Without dead ends: 1951 [2024-10-14 05:13:54,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:54,542 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 0 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:54,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3148 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:13:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-10-14 05:13:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1951. [2024-10-14 05:13:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1570 states have (on average 1.280891719745223) internal successors, (2011), 1586 states have internal predecessors, (2011), 193 states have call successors, (193), 143 states have call predecessors, (193), 186 states have return successors, (260), 222 states have call predecessors, (260), 192 states have call successors, (260) [2024-10-14 05:13:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2464 transitions. [2024-10-14 05:13:54,694 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2464 transitions. Word has length 131 [2024-10-14 05:13:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:54,695 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 2464 transitions. [2024-10-14 05:13:54,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:13:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2464 transitions. [2024-10-14 05:13:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 05:13:54,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:54,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:54,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 05:13:54,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 05:13:54,899 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:54,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1121280322, now seen corresponding path program 1 times [2024-10-14 05:13:54,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011944691] [2024-10-14 05:13:54,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 05:13:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 05:13:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:13:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 05:13:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 05:13:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:13:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-14 05:13:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011944691] [2024-10-14 05:13:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011944691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444870250] [2024-10-14 05:13:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:54,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:54,993 INFO L87 Difference]: Start difference. First operand 1951 states and 2464 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 05:13:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:55,845 INFO L93 Difference]: Finished difference Result 1999 states and 2514 transitions. [2024-10-14 05:13:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:55,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2024-10-14 05:13:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:55,853 INFO L225 Difference]: With dead ends: 1999 [2024-10-14 05:13:55,854 INFO L226 Difference]: Without dead ends: 1659 [2024-10-14 05:13:55,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:55,856 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 713 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:55,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1399 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-10-14 05:13:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1614. [2024-10-14 05:13:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1317 states have (on average 1.3052391799544418) internal successors, (1719), 1330 states have internal predecessors, (1719), 152 states have call successors, (152), 108 states have call predecessors, (152), 143 states have return successors, (205), 176 states have call predecessors, (205), 151 states have call successors, (205) [2024-10-14 05:13:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2076 transitions. [2024-10-14 05:13:56,002 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2076 transitions. Word has length 133 [2024-10-14 05:13:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:56,003 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2076 transitions. [2024-10-14 05:13:56,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 05:13:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2076 transitions. [2024-10-14 05:13:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:13:56,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:56,006 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:56,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:13:56,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:56,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1716805501, now seen corresponding path program 1 times [2024-10-14 05:13:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940171756] [2024-10-14 05:13:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:13:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:13:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 05:13:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 05:13:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:13:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:13:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 05:13:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 05:13:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:56,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940171756] [2024-10-14 05:13:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940171756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217548352] [2024-10-14 05:13:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:56,120 INFO L87 Difference]: Start difference. First operand 1614 states and 2076 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:13:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:56,948 INFO L93 Difference]: Finished difference Result 2765 states and 3460 transitions. [2024-10-14 05:13:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:13:56,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-14 05:13:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:56,955 INFO L225 Difference]: With dead ends: 2765 [2024-10-14 05:13:56,955 INFO L226 Difference]: Without dead ends: 1594 [2024-10-14 05:13:56,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:56,958 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 944 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:56,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1532 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-14 05:13:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1513. [2024-10-14 05:13:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1240 states have (on average 1.3161290322580645) internal successors, (1632), 1253 states have internal predecessors, (1632), 140 states have call successors, (140), 98 states have call predecessors, (140), 131 states have return successors, (187), 162 states have call predecessors, (187), 139 states have call successors, (187) [2024-10-14 05:13:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1959 transitions. [2024-10-14 05:13:57,074 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1959 transitions. Word has length 145 [2024-10-14 05:13:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:57,074 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1959 transitions. [2024-10-14 05:13:57,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:13:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1959 transitions. [2024-10-14 05:13:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-14 05:13:57,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:57,077 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:13:57,077 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:57,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash 430610257, now seen corresponding path program 1 times [2024-10-14 05:13:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323469892] [2024-10-14 05:13:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:13:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:13:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 05:13:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 05:13:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 05:13:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:13:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 05:13:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 05:13:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323469892] [2024-10-14 05:13:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323469892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721436780] [2024-10-14 05:13:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:57,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:57,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:13:57,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:13:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:57,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 05:13:57,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 05:13:57,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:13:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-14 05:13:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721436780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:13:57,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:13:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-14 05:13:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573377895] [2024-10-14 05:13:57,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:13:57,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 05:13:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:57,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 05:13:57,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-14 05:13:57,853 INFO L87 Difference]: Start difference. First operand 1513 states and 1959 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-14 05:13:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:59,229 INFO L93 Difference]: Finished difference Result 3104 states and 3953 transitions. [2024-10-14 05:13:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 05:13:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-14 05:13:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:59,236 INFO L225 Difference]: With dead ends: 3104 [2024-10-14 05:13:59,236 INFO L226 Difference]: Without dead ends: 1881 [2024-10-14 05:13:59,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-14 05:13:59,239 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 2047 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:59,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1636 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2024-10-14 05:13:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1773. [2024-10-14 05:13:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1425 states have (on average 1.2750877192982457) internal successors, (1817), 1439 states have internal predecessors, (1817), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-14 05:13:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2253 transitions. [2024-10-14 05:13:59,407 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2253 transitions. Word has length 147 [2024-10-14 05:13:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:59,407 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2253 transitions. [2024-10-14 05:13:59,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-14 05:13:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2253 transitions. [2024-10-14 05:13:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:13:59,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:59,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:13:59,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:13:59,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 05:13:59,615 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1626747324, now seen corresponding path program 1 times [2024-10-14 05:13:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742089923] [2024-10-14 05:13:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:13:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:13:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:13:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:13:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:59,804 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-14 05:13:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742089923] [2024-10-14 05:13:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742089923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:13:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395139888] [2024-10-14 05:13:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:59,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:13:59,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:13:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:13:59,807 INFO L87 Difference]: Start difference. First operand 1773 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:01,836 INFO L93 Difference]: Finished difference Result 2242 states and 3038 transitions. [2024-10-14 05:14:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:01,843 INFO L225 Difference]: With dead ends: 2242 [2024-10-14 05:14:01,844 INFO L226 Difference]: Without dead ends: 1903 [2024-10-14 05:14:01,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:01,845 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1068 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:01,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 826 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:14:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-10-14 05:14:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1773. [2024-10-14 05:14:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1425 states have (on average 1.2743859649122806) internal successors, (1816), 1439 states have internal predecessors, (1816), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-14 05:14:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2252 transitions. [2024-10-14 05:14:02,422 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2252 transitions. Word has length 161 [2024-10-14 05:14:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:02,423 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2252 transitions. [2024-10-14 05:14:02,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2252 transitions. [2024-10-14 05:14:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:02,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:02,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:02,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:14:02,428 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:02,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -267586562, now seen corresponding path program 1 times [2024-10-14 05:14:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022517610] [2024-10-14 05:14:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,640 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-14 05:14:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022517610] [2024-10-14 05:14:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022517610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:14:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463813369] [2024-10-14 05:14:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:02,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:14:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:14:02,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:14:02,645 INFO L87 Difference]: Start difference. First operand 1773 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:04,721 INFO L93 Difference]: Finished difference Result 2234 states and 3021 transitions. [2024-10-14 05:14:04,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:04,728 INFO L225 Difference]: With dead ends: 2234 [2024-10-14 05:14:04,728 INFO L226 Difference]: Without dead ends: 1903 [2024-10-14 05:14:04,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:04,730 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1059 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:04,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 824 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:14:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-10-14 05:14:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1773. [2024-10-14 05:14:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1425 states have (on average 1.2736842105263158) internal successors, (1815), 1439 states have internal predecessors, (1815), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-14 05:14:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2251 transitions. [2024-10-14 05:14:05,138 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2251 transitions. Word has length 161 [2024-10-14 05:14:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2251 transitions. [2024-10-14 05:14:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2251 transitions. [2024-10-14 05:14:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:05,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:05,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:05,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:14:05,142 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:05,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash -605874112, now seen corresponding path program 1 times [2024-10-14 05:14:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842470198] [2024-10-14 05:14:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:05,374 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-14 05:14:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:05,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842470198] [2024-10-14 05:14:05,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842470198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:05,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:14:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011709729] [2024-10-14 05:14:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:05,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:14:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:14:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:14:05,376 INFO L87 Difference]: Start difference. First operand 1773 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:08,152 INFO L93 Difference]: Finished difference Result 2708 states and 3817 transitions. [2024-10-14 05:14:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:14:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:08,160 INFO L225 Difference]: With dead ends: 2708 [2024-10-14 05:14:08,161 INFO L226 Difference]: Without dead ends: 2380 [2024-10-14 05:14:08,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:08,163 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1681 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:08,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1231 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:14:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-10-14 05:14:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2121. [2024-10-14 05:14:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1745 states have (on average 1.3426934097421204) internal successors, (2343), 1760 states have internal predecessors, (2343), 201 states have call successors, (201), 142 states have call predecessors, (201), 173 states have return successors, (280), 219 states have call predecessors, (280), 200 states have call successors, (280) [2024-10-14 05:14:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2824 transitions. [2024-10-14 05:14:08,565 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2824 transitions. Word has length 161 [2024-10-14 05:14:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:08,565 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2824 transitions. [2024-10-14 05:14:08,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2824 transitions. [2024-10-14 05:14:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:08,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:08,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:14:08,568 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:08,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1092657024, now seen corresponding path program 1 times [2024-10-14 05:14:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311264745] [2024-10-14 05:14:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,811 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-14 05:14:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311264745] [2024-10-14 05:14:08,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311264745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:08,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:08,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506602777] [2024-10-14 05:14:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:08,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:08,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:08,813 INFO L87 Difference]: Start difference. First operand 2121 states and 2824 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:12,653 INFO L93 Difference]: Finished difference Result 3555 states and 5229 transitions. [2024-10-14 05:14:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:12,666 INFO L225 Difference]: With dead ends: 3555 [2024-10-14 05:14:12,666 INFO L226 Difference]: Without dead ends: 2879 [2024-10-14 05:14:12,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:12,671 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 1724 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3969 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 4065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:12,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2218 Invalid, 4065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3969 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 05:14:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-10-14 05:14:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2443. [2024-10-14 05:14:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.3825404610102991) internal successors, (2819), 2055 states have internal predecessors, (2819), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-14 05:14:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3344 transitions. [2024-10-14 05:14:13,040 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3344 transitions. Word has length 161 [2024-10-14 05:14:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:13,040 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3344 transitions. [2024-10-14 05:14:13,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3344 transitions. [2024-10-14 05:14:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:13,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:13,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:13,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:14:13,043 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:13,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1066427070, now seen corresponding path program 1 times [2024-10-14 05:14:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158298790] [2024-10-14 05:14:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:13,335 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-14 05:14:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:13,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158298790] [2024-10-14 05:14:13,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158298790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:13,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:13,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542784530] [2024-10-14 05:14:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:13,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:13,337 INFO L87 Difference]: Start difference. First operand 2443 states and 3344 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:15,512 INFO L93 Difference]: Finished difference Result 3895 states and 5789 transitions. [2024-10-14 05:14:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:15,531 INFO L225 Difference]: With dead ends: 3895 [2024-10-14 05:14:15,531 INFO L226 Difference]: Without dead ends: 2897 [2024-10-14 05:14:15,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:15,535 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1276 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:15,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 1250 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:14:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2024-10-14 05:14:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2443. [2024-10-14 05:14:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.381069151544875) internal successors, (2816), 2055 states have internal predecessors, (2816), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-14 05:14:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3341 transitions. [2024-10-14 05:14:15,855 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3341 transitions. Word has length 161 [2024-10-14 05:14:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:15,855 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3341 transitions. [2024-10-14 05:14:15,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3341 transitions. [2024-10-14 05:14:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:15,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:15,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:14:15,859 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1136074944, now seen corresponding path program 1 times [2024-10-14 05:14:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025471852] [2024-10-14 05:14:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:16,118 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-14 05:14:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:16,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025471852] [2024-10-14 05:14:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025471852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:16,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830437582] [2024-10-14 05:14:16,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:16,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:16,123 INFO L87 Difference]: Start difference. First operand 2443 states and 3341 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:18,187 INFO L93 Difference]: Finished difference Result 3891 states and 5772 transitions. [2024-10-14 05:14:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:18,198 INFO L225 Difference]: With dead ends: 3891 [2024-10-14 05:14:18,198 INFO L226 Difference]: Without dead ends: 2893 [2024-10-14 05:14:18,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:18,202 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1360 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:18,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1249 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:14:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2024-10-14 05:14:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2443. [2024-10-14 05:14:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.3795978420794508) internal successors, (2813), 2055 states have internal predecessors, (2813), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-14 05:14:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3338 transitions. [2024-10-14 05:14:18,578 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3338 transitions. Word has length 161 [2024-10-14 05:14:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:18,578 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3338 transitions. [2024-10-14 05:14:18,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3338 transitions. [2024-10-14 05:14:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:18,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:18,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:14:18,581 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1553963646, now seen corresponding path program 1 times [2024-10-14 05:14:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29212275] [2024-10-14 05:14:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:18,819 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-14 05:14:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29212275] [2024-10-14 05:14:18,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29212275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:18,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:18,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875946665] [2024-10-14 05:14:18,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:18,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:18,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:18,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:18,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:18,822 INFO L87 Difference]: Start difference. First operand 2443 states and 3338 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:20,773 INFO L93 Difference]: Finished difference Result 3887 states and 5755 transitions. [2024-10-14 05:14:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:20,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:20,784 INFO L225 Difference]: With dead ends: 3887 [2024-10-14 05:14:20,785 INFO L226 Difference]: Without dead ends: 2889 [2024-10-14 05:14:20,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:20,788 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1471 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:20,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1045 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:14:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2024-10-14 05:14:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2443. [2024-10-14 05:14:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.3781265326140264) internal successors, (2810), 2055 states have internal predecessors, (2810), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-14 05:14:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3335 transitions. [2024-10-14 05:14:21,236 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3335 transitions. Word has length 161 [2024-10-14 05:14:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:21,237 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3335 transitions. [2024-10-14 05:14:21,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3335 transitions. [2024-10-14 05:14:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:21,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:21,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:21,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:14:21,239 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1342050048, now seen corresponding path program 1 times [2024-10-14 05:14:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469259473] [2024-10-14 05:14:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:21,529 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-14 05:14:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469259473] [2024-10-14 05:14:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469259473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990960498] [2024-10-14 05:14:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:21,531 INFO L87 Difference]: Start difference. First operand 2443 states and 3335 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:25,299 INFO L93 Difference]: Finished difference Result 4782 states and 7211 transitions. [2024-10-14 05:14:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:25,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:25,315 INFO L225 Difference]: With dead ends: 4782 [2024-10-14 05:14:25,315 INFO L226 Difference]: Without dead ends: 3784 [2024-10-14 05:14:25,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:25,319 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1698 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:25,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 2216 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3869 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:14:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2024-10-14 05:14:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3099. [2024-10-14 05:14:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2639 states have (on average 1.429708222811671) internal successors, (3773), 2657 states have internal predecessors, (3773), 264 states have call successors, (264), 160 states have call predecessors, (264), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2024-10-14 05:14:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4390 transitions. [2024-10-14 05:14:25,664 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4390 transitions. Word has length 161 [2024-10-14 05:14:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4390 transitions. [2024-10-14 05:14:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4390 transitions. [2024-10-14 05:14:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:25,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:25,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:25,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:14:25,667 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:25,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1335476798, now seen corresponding path program 1 times [2024-10-14 05:14:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878516015] [2024-10-14 05:14:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:25,892 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-14 05:14:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878516015] [2024-10-14 05:14:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878516015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217931528] [2024-10-14 05:14:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:25,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:25,894 INFO L87 Difference]: Start difference. First operand 3099 states and 4390 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:28,008 INFO L93 Difference]: Finished difference Result 5425 states and 8254 transitions. [2024-10-14 05:14:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:14:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:28,023 INFO L225 Difference]: With dead ends: 5425 [2024-10-14 05:14:28,023 INFO L226 Difference]: Without dead ends: 3771 [2024-10-14 05:14:28,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:14:28,030 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1271 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:28,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1250 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:14:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2024-10-14 05:14:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 3099. [2024-10-14 05:14:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2639 states have (on average 1.4278135657446003) internal successors, (3768), 2657 states have internal predecessors, (3768), 264 states have call successors, (264), 160 states have call predecessors, (264), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2024-10-14 05:14:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4385 transitions. [2024-10-14 05:14:28,533 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4385 transitions. Word has length 161 [2024-10-14 05:14:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:28,533 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4385 transitions. [2024-10-14 05:14:28,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4385 transitions. [2024-10-14 05:14:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:28,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:28,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:28,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:14:28,535 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:28,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1698943296, now seen corresponding path program 1 times [2024-10-14 05:14:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277003145] [2024-10-14 05:14:28,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:28,796 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-14 05:14:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277003145] [2024-10-14 05:14:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277003145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:28,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:28,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144842683] [2024-10-14 05:14:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:28,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:28,799 INFO L87 Difference]: Start difference. First operand 3099 states and 4385 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:32,605 INFO L93 Difference]: Finished difference Result 7160 states and 11062 transitions. [2024-10-14 05:14:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:32,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:14:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:32,625 INFO L225 Difference]: With dead ends: 7160 [2024-10-14 05:14:32,626 INFO L226 Difference]: Without dead ends: 5506 [2024-10-14 05:14:32,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:32,632 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1696 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:32,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 2216 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:14:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2024-10-14 05:14:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4413. [2024-10-14 05:14:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4413 states, 3841 states have (on average 1.4808643582400416) internal successors, (5688), 3863 states have internal predecessors, (5688), 348 states have call successors, (348), 184 states have call predecessors, (348), 222 states have return successors, (459), 373 states have call predecessors, (459), 347 states have call successors, (459) [2024-10-14 05:14:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 6495 transitions. [2024-10-14 05:14:33,171 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 6495 transitions. Word has length 161 [2024-10-14 05:14:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 4413 states and 6495 transitions. [2024-10-14 05:14:33,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 6495 transitions. [2024-10-14 05:14:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:14:33,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:33,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:14:33,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 05:14:33,176 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:33,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1987762686, now seen corresponding path program 1 times [2024-10-14 05:14:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:33,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281160619] [2024-10-14 05:14:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:33,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:14:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:14:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:14:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:14:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:33,414 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-14 05:14:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281160619] [2024-10-14 05:14:33,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281160619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995454898] [2024-10-14 05:14:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:33,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:33,417 INFO L87 Difference]: Start difference. First operand 4413 states and 6495 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)