./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.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 27587b975a36272f97d565edc796c457ff04a64b538fe9933b800d0dda8dcceb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:12:16,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:12:16,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:12:16,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:12:16,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:12:16,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:12:16,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:12:16,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:12:16,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:12:16,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:12:16,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:12:16,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:12:16,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:12:16,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:12:16,273 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:12:16,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:12:16,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:12:16,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:12:16,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:12:16,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:12:16,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:12:16,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:12:16,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:12:16,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:12:16,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:12:16,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:12:16,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:12:16,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:12:16,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:12:16,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:12:16,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:12:16,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:12:16,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:12:16,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:12:16,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:12:16,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:12:16,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:12:16,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:12:16,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:12:16,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:12:16,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:12:16,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:12:16,280 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 -> 27587b975a36272f97d565edc796c457ff04a64b538fe9933b800d0dda8dcceb [2024-11-16 09:12:16,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:12:16,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:12:16,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:12:16,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:12:16,466 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:12:16,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c [2024-11-16 09:12:17,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:12:18,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:12:18,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.05.cil-2.c [2024-11-16 09:12:18,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd65732c3/85bc7ba4aa5d42b4beeb5a03284f266e/FLAGe46e5519c [2024-11-16 09:12:18,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd65732c3/85bc7ba4aa5d42b4beeb5a03284f266e [2024-11-16 09:12:18,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:12:18,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:12:18,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:12:18,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:12:18,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:12:18,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:12:18" (1/1) ... [2024-11-16 09:12:18,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd8eea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:18, skipping insertion in model container [2024-11-16 09:12:18,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:12:18" (1/1) ... [2024-11-16 09:12:18,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:12:19,689 WARN L250 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/Problem05_label45+token_ring.05.cil-2.c[380323,380336] [2024-11-16 09:12:19,714 WARN L250 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/Problem05_label45+token_ring.05.cil-2.c[383339,383352] [2024-11-16 09:12:19,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:12:19,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:12:20,486 WARN L250 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/Problem05_label45+token_ring.05.cil-2.c[380323,380336] [2024-11-16 09:12:20,492 WARN L250 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/Problem05_label45+token_ring.05.cil-2.c[383339,383352] [2024-11-16 09:12:20,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:12:20,559 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:12:20,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20 WrapperNode [2024-11-16 09:12:20,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:12:20,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:12:20,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:12:20,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:12:20,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:20,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:20,874 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 12810 [2024-11-16 09:12:20,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:12:20,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:12:20,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:12:20,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:12:20,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:20,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:20,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,010 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-11-16 09:12:21,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:12:21,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:12:21,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:12:21,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:12:21,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (1/1) ... [2024-11-16 09:12:21,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:12:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:12:21,419 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-11-16 09:12:21,423 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-11-16 09:12:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:12:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-16 09:12:21,464 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-16 09:12:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-16 09:12:21,464 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-16 09:12:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-16 09:12:21,465 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-16 09:12:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-16 09:12:21,465 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-16 09:12:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-16 09:12:21,465 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-16 09:12:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-16 09:12:21,465 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-16 09:12:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-16 09:12:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-16 09:12:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:12:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:12:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:12:21,652 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:12:21,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:12:27,562 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2024-11-16 09:12:27,563 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2024-11-16 09:12:27,564 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2024-11-16 09:12:27,564 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2024-11-16 09:12:27,564 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2024-11-16 09:12:27,565 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2024-11-16 09:12:27,565 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2024-11-16 09:12:27,840 INFO L? ?]: Removed 1717 outVars from TransFormulas that were not future-live. [2024-11-16 09:12:27,841 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:12:27,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:12:27,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:12:27,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:12:27 BoogieIcfgContainer [2024-11-16 09:12:27,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:12:27,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:12:27,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:12:27,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:12:27,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:12:18" (1/3) ... [2024-11-16 09:12:27,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6fcca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:12:27, skipping insertion in model container [2024-11-16 09:12:27,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:12:20" (2/3) ... [2024-11-16 09:12:27,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6fcca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:12:27, skipping insertion in model container [2024-11-16 09:12:27,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:12:27" (3/3) ... [2024-11-16 09:12:27,919 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.05.cil-2.c [2024-11-16 09:12:27,939 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:12:27,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:12:28,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:12:28,077 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;@495faefd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:12:28,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:12:28,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 2439 states, 2408 states have (on average 1.8384551495016612) internal successors, (4427), 2413 states have internal predecessors, (4427), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 09:12:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:28,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:28,106 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] [2024-11-16 09:12:28,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:28,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1318933517, now seen corresponding path program 1 times [2024-11-16 09:12:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:28,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603332917] [2024-11-16 09:12:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:28,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603332917] [2024-11-16 09:12:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603332917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:28,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 09:12:28,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439234556] [2024-11-16 09:12:28,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 09:12:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 09:12:28,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:12:28,817 INFO L87 Difference]: Start difference. First operand has 2439 states, 2408 states have (on average 1.8384551495016612) internal successors, (4427), 2413 states have internal predecessors, (4427), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:30,410 INFO L93 Difference]: Finished difference Result 5220 states and 9493 transitions. [2024-11-16 09:12:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:12:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:30,432 INFO L225 Difference]: With dead ends: 5220 [2024-11-16 09:12:30,432 INFO L226 Difference]: Without dead ends: 2722 [2024-11-16 09:12:30,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:12:30,442 INFO L432 NwaCegarLoop]: 4246 mSDtfsCounter, 4834 mSDsluCounter, 12761 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4846 SdHoareTripleChecker+Valid, 17007 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:30,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4846 Valid, 17007 Invalid, 1186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:12:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2024-11-16 09:12:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2590. [2024-11-16 09:12:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2540 states have (on average 1.8023622047244094) internal successors, (4578), 2544 states have internal predecessors, (4578), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-16 09:12:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4649 transitions. [2024-11-16 09:12:30,565 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4649 transitions. Word has length 107 [2024-11-16 09:12:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:30,565 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4649 transitions. [2024-11-16 09:12:30,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4649 transitions. [2024-11-16 09:12:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:30,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:30,569 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] [2024-11-16 09:12:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:12:30,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1959458763, now seen corresponding path program 1 times [2024-11-16 09:12:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:30,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029615591] [2024-11-16 09:12:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:30,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:30,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:30,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:30,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029615591] [2024-11-16 09:12:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029615591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:30,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:30,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404282553] [2024-11-16 09:12:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:30,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:30,771 INFO L87 Difference]: Start difference. First operand 2590 states and 4649 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:31,814 INFO L93 Difference]: Finished difference Result 3181 states and 5553 transitions. [2024-11-16 09:12:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:12:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:31,822 INFO L225 Difference]: With dead ends: 3181 [2024-11-16 09:12:31,823 INFO L226 Difference]: Without dead ends: 2727 [2024-11-16 09:12:31,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:12:31,825 INFO L432 NwaCegarLoop]: 4160 mSDtfsCounter, 4646 mSDsluCounter, 12376 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 16536 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:31,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 16536 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:12:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2024-11-16 09:12:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2590. [2024-11-16 09:12:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2540 states have (on average 1.8015748031496064) internal successors, (4576), 2544 states have internal predecessors, (4576), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-16 09:12:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4647 transitions. [2024-11-16 09:12:31,878 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4647 transitions. Word has length 107 [2024-11-16 09:12:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:31,879 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4647 transitions. [2024-11-16 09:12:31,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4647 transitions. [2024-11-16 09:12:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:31,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:31,881 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] [2024-11-16 09:12:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:12:31,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1020927148, now seen corresponding path program 1 times [2024-11-16 09:12:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587759964] [2024-11-16 09:12:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587759964] [2024-11-16 09:12:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587759964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732087547] [2024-11-16 09:12:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:32,040 INFO L87 Difference]: Start difference. First operand 2590 states and 4647 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:33,499 INFO L93 Difference]: Finished difference Result 3470 states and 5976 transitions. [2024-11-16 09:12:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:12:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:33,510 INFO L225 Difference]: With dead ends: 3470 [2024-11-16 09:12:33,510 INFO L226 Difference]: Without dead ends: 3016 [2024-11-16 09:12:33,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:12:33,515 INFO L432 NwaCegarLoop]: 4340 mSDtfsCounter, 4758 mSDsluCounter, 17163 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 21503 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:33,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 21503 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:12:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2024-11-16 09:12:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 2805. [2024-11-16 09:12:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2734 states have (on average 1.776517922457937) internal successors, (4857), 2739 states have internal predecessors, (4857), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-16 09:12:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4958 transitions. [2024-11-16 09:12:33,579 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4958 transitions. Word has length 107 [2024-11-16 09:12:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:33,579 INFO L471 AbstractCegarLoop]: Abstraction has 2805 states and 4958 transitions. [2024-11-16 09:12:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4958 transitions. [2024-11-16 09:12:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:33,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:33,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] [2024-11-16 09:12:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:12:33,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1406293931, now seen corresponding path program 1 times [2024-11-16 09:12:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014114433] [2024-11-16 09:12:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014114433] [2024-11-16 09:12:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014114433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:33,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955382113] [2024-11-16 09:12:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:33,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:33,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:33,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:33,779 INFO L87 Difference]: Start difference. First operand 2805 states and 4958 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:35,333 INFO L93 Difference]: Finished difference Result 4243 states and 7125 transitions. [2024-11-16 09:12:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:12:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:35,345 INFO L225 Difference]: With dead ends: 4243 [2024-11-16 09:12:35,345 INFO L226 Difference]: Without dead ends: 3574 [2024-11-16 09:12:35,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:12:35,352 INFO L432 NwaCegarLoop]: 4338 mSDtfsCounter, 4756 mSDsluCounter, 17163 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 21501 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:35,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 21501 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:12:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2024-11-16 09:12:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3237. [2024-11-16 09:12:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 3124 states have (on average 1.735595390524968) internal successors, (5422), 3131 states have internal predecessors, (5422), 77 states have call successors, (77), 31 states have call predecessors, (77), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-16 09:12:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 5587 transitions. [2024-11-16 09:12:35,426 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 5587 transitions. Word has length 107 [2024-11-16 09:12:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:35,427 INFO L471 AbstractCegarLoop]: Abstraction has 3237 states and 5587 transitions. [2024-11-16 09:12:35,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 5587 transitions. [2024-11-16 09:12:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:35,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:35,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 09:12:35,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:12:35,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:35,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash 243842868, now seen corresponding path program 1 times [2024-11-16 09:12:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:35,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941905860] [2024-11-16 09:12:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941905860] [2024-11-16 09:12:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941905860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277932564] [2024-11-16 09:12:35,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:35,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:35,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:35,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:35,576 INFO L87 Difference]: Start difference. First operand 3237 states and 5587 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:37,281 INFO L93 Difference]: Finished difference Result 5745 states and 9350 transitions. [2024-11-16 09:12:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:12:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:37,294 INFO L225 Difference]: With dead ends: 5745 [2024-11-16 09:12:37,295 INFO L226 Difference]: Without dead ends: 4644 [2024-11-16 09:12:37,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:12:37,297 INFO L432 NwaCegarLoop]: 4338 mSDtfsCounter, 4758 mSDsluCounter, 17163 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 21501 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:37,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 21501 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 09:12:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2024-11-16 09:12:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 4103. [2024-11-16 09:12:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4103 states, 3906 states have (on average 1.677931387608807) internal successors, (6554), 3917 states have internal predecessors, (6554), 133 states have call successors, (133), 55 states have call predecessors, (133), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-16 09:12:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 6853 transitions. [2024-11-16 09:12:37,392 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 6853 transitions. Word has length 107 [2024-11-16 09:12:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:37,392 INFO L471 AbstractCegarLoop]: Abstraction has 4103 states and 6853 transitions. [2024-11-16 09:12:37,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6853 transitions. [2024-11-16 09:12:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:37,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:37,395 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] [2024-11-16 09:12:37,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:12:37,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2098188405, now seen corresponding path program 1 times [2024-11-16 09:12:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292056414] [2024-11-16 09:12:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:37,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292056414] [2024-11-16 09:12:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292056414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829417963] [2024-11-16 09:12:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:37,544 INFO L87 Difference]: Start difference. First operand 4103 states and 6853 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:39,043 INFO L93 Difference]: Finished difference Result 9373 states and 14750 transitions. [2024-11-16 09:12:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 09:12:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:39,069 INFO L225 Difference]: With dead ends: 9373 [2024-11-16 09:12:39,069 INFO L226 Difference]: Without dead ends: 7406 [2024-11-16 09:12:39,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:12:39,077 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 4967 mSDsluCounter, 17155 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4985 SdHoareTripleChecker+Valid, 21491 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:39,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4985 Valid, 21491 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:12:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7406 states. [2024-11-16 09:12:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7406 to 5826. [2024-11-16 09:12:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 5469 states have (on average 1.6141890656427136) internal successors, (8828), 5488 states have internal predecessors, (8828), 237 states have call successors, (237), 103 states have call predecessors, (237), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-11-16 09:12:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 9397 transitions. [2024-11-16 09:12:39,263 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 9397 transitions. Word has length 107 [2024-11-16 09:12:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:39,263 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 9397 transitions. [2024-11-16 09:12:39,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 9397 transitions. [2024-11-16 09:12:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:39,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:39,269 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] [2024-11-16 09:12:39,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:12:39,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:39,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 888946166, now seen corresponding path program 1 times [2024-11-16 09:12:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939438421] [2024-11-16 09:12:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939438421] [2024-11-16 09:12:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939438421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42785832] [2024-11-16 09:12:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:39,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:39,389 INFO L87 Difference]: Start difference. First operand 5826 states and 9397 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:40,270 INFO L93 Difference]: Finished difference Result 10455 states and 16406 transitions. [2024-11-16 09:12:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:12:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:40,298 INFO L225 Difference]: With dead ends: 10455 [2024-11-16 09:12:40,299 INFO L226 Difference]: Without dead ends: 6765 [2024-11-16 09:12:40,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:12:40,310 INFO L432 NwaCegarLoop]: 4159 mSDtfsCounter, 4653 mSDsluCounter, 12374 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4666 SdHoareTripleChecker+Valid, 16533 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:40,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4666 Valid, 16533 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:12:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2024-11-16 09:12:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 5826. [2024-11-16 09:12:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 5469 states have (on average 1.6110806363137684) internal successors, (8811), 5488 states have internal predecessors, (8811), 237 states have call successors, (237), 103 states have call predecessors, (237), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-11-16 09:12:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 9380 transitions. [2024-11-16 09:12:40,581 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 9380 transitions. Word has length 107 [2024-11-16 09:12:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:40,581 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 9380 transitions. [2024-11-16 09:12:40,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 9380 transitions. [2024-11-16 09:12:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:40,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:40,587 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] [2024-11-16 09:12:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:12:40,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2096864341, now seen corresponding path program 1 times [2024-11-16 09:12:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413484329] [2024-11-16 09:12:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413484329] [2024-11-16 09:12:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413484329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:40,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191785244] [2024-11-16 09:12:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:40,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:40,756 INFO L87 Difference]: Start difference. First operand 5826 states and 9380 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:42,772 INFO L93 Difference]: Finished difference Result 15526 states and 23872 transitions. [2024-11-16 09:12:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 09:12:42,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:42,813 INFO L225 Difference]: With dead ends: 15526 [2024-11-16 09:12:42,813 INFO L226 Difference]: Without dead ends: 11836 [2024-11-16 09:12:42,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:12:42,829 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 4881 mSDsluCounter, 17155 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4899 SdHoareTripleChecker+Valid, 21491 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:42,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4899 Valid, 21491 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 09:12:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2024-11-16 09:12:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 9278. [2024-11-16 09:12:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 8609 states have (on average 1.552212800557556) internal successors, (13363), 8644 states have internal predecessors, (13363), 437 states have call successors, (437), 199 states have call predecessors, (437), 230 states have return successors, (710), 466 states have call predecessors, (710), 435 states have call successors, (710) [2024-11-16 09:12:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 14510 transitions. [2024-11-16 09:12:43,280 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 14510 transitions. Word has length 107 [2024-11-16 09:12:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:43,281 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 14510 transitions. [2024-11-16 09:12:43,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 14510 transitions. [2024-11-16 09:12:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:43,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:43,287 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] [2024-11-16 09:12:43,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:12:43,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:43,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 611808790, now seen corresponding path program 1 times [2024-11-16 09:12:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:43,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776248272] [2024-11-16 09:12:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776248272] [2024-11-16 09:12:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776248272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:43,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634461749] [2024-11-16 09:12:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:43,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:43,400 INFO L87 Difference]: Start difference. First operand 9278 states and 14510 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:44,308 INFO L93 Difference]: Finished difference Result 18091 states and 27881 transitions. [2024-11-16 09:12:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:12:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:44,338 INFO L225 Difference]: With dead ends: 18091 [2024-11-16 09:12:44,339 INFO L226 Difference]: Without dead ends: 10949 [2024-11-16 09:12:44,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:12:44,357 INFO L432 NwaCegarLoop]: 4159 mSDtfsCounter, 4652 mSDsluCounter, 12374 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 16533 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:44,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 16533 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:12:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10949 states. [2024-11-16 09:12:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10949 to 9278. [2024-11-16 09:12:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 8609 states have (on average 1.5483796027413173) internal successors, (13330), 8644 states have internal predecessors, (13330), 437 states have call successors, (437), 199 states have call predecessors, (437), 230 states have return successors, (710), 466 states have call predecessors, (710), 435 states have call successors, (710) [2024-11-16 09:12:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 14477 transitions. [2024-11-16 09:12:44,733 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 14477 transitions. Word has length 107 [2024-11-16 09:12:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 14477 transitions. [2024-11-16 09:12:44,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 14477 transitions. [2024-11-16 09:12:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:44,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:44,743 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] [2024-11-16 09:12:44,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:12:44,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:44,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1395187765, now seen corresponding path program 1 times [2024-11-16 09:12:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037551249] [2024-11-16 09:12:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:44,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:44,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037551249] [2024-11-16 09:12:44,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037551249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:44,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338311005] [2024-11-16 09:12:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:44,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:44,881 INFO L87 Difference]: Start difference. First operand 9278 states and 14477 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:46,086 INFO L93 Difference]: Finished difference Result 18057 states and 27714 transitions. [2024-11-16 09:12:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:12:46,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:46,117 INFO L225 Difference]: With dead ends: 18057 [2024-11-16 09:12:46,118 INFO L226 Difference]: Without dead ends: 10915 [2024-11-16 09:12:46,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:12:46,137 INFO L432 NwaCegarLoop]: 4159 mSDtfsCounter, 4566 mSDsluCounter, 16476 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 20635 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:46,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 20635 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 09:12:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10915 states. [2024-11-16 09:12:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10915 to 9278. [2024-11-16 09:12:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 8609 states have (on average 1.5445464049250783) internal successors, (13297), 8644 states have internal predecessors, (13297), 437 states have call successors, (437), 199 states have call predecessors, (437), 230 states have return successors, (710), 466 states have call predecessors, (710), 435 states have call successors, (710) [2024-11-16 09:12:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 14444 transitions. [2024-11-16 09:12:46,434 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 14444 transitions. Word has length 107 [2024-11-16 09:12:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:46,435 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 14444 transitions. [2024-11-16 09:12:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 14444 transitions. [2024-11-16 09:12:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:46,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:46,441 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] [2024-11-16 09:12:46,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:12:46,441 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 866268726, now seen corresponding path program 1 times [2024-11-16 09:12:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356570801] [2024-11-16 09:12:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:46,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:46,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:46,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356570801] [2024-11-16 09:12:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356570801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:12:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398031325] [2024-11-16 09:12:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:46,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:12:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:12:46,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:12:46,566 INFO L87 Difference]: Start difference. First operand 9278 states and 14444 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:48,467 INFO L93 Difference]: Finished difference Result 26784 states and 40516 transitions. [2024-11-16 09:12:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 09:12:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:48,517 INFO L225 Difference]: With dead ends: 26784 [2024-11-16 09:12:48,518 INFO L226 Difference]: Without dead ends: 19642 [2024-11-16 09:12:48,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:12:48,540 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 4746 mSDsluCounter, 17155 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4764 SdHoareTripleChecker+Valid, 21491 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:48,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4764 Valid, 21491 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:12:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2024-11-16 09:12:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 16229. [2024-11-16 09:12:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16229 states, 14952 states have (on average 1.4991305510968431) internal successors, (22415), 15019 states have internal predecessors, (22415), 821 states have call successors, (821), 391 states have call predecessors, (821), 454 states have return successors, (1612), 882 states have call predecessors, (1612), 819 states have call successors, (1612) [2024-11-16 09:12:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16229 states to 16229 states and 24848 transitions. [2024-11-16 09:12:49,312 INFO L78 Accepts]: Start accepts. Automaton has 16229 states and 24848 transitions. Word has length 107 [2024-11-16 09:12:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:49,313 INFO L471 AbstractCegarLoop]: Abstraction has 16229 states and 24848 transitions. [2024-11-16 09:12:49,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 16229 states and 24848 transitions. [2024-11-16 09:12:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 09:12:49,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:49,324 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] [2024-11-16 09:12:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:12:49,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 295017493, now seen corresponding path program 1 times [2024-11-16 09:12:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21571629] [2024-11-16 09:12:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:49,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:12:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21571629] [2024-11-16 09:12:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21571629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:49,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:12:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 09:12:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721902518] [2024-11-16 09:12:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:49,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 09:12:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 09:12:49,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:12:49,416 INFO L87 Difference]: Start difference. First operand 16229 states and 24848 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:51,888 INFO L93 Difference]: Finished difference Result 49386 states and 74125 transitions. [2024-11-16 09:12:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:12:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2024-11-16 09:12:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:51,960 INFO L225 Difference]: With dead ends: 49386 [2024-11-16 09:12:51,960 INFO L226 Difference]: Without dead ends: 35294 [2024-11-16 09:12:51,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 09:12:51,985 INFO L432 NwaCegarLoop]: 4367 mSDtfsCounter, 4999 mSDsluCounter, 12701 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5030 SdHoareTripleChecker+Valid, 17068 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:51,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5030 Valid, 17068 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:12:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35294 states. [2024-11-16 09:12:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35294 to 29535. [2024-11-16 09:12:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29535 states, 26989 states have (on average 1.4582237207751305) internal successors, (39356), 27185 states have internal predecessors, (39356), 1636 states have call successors, (1636), 781 states have call predecessors, (1636), 908 states have return successors, (3157), 1632 states have call predecessors, (3157), 1634 states have call successors, (3157) [2024-11-16 09:12:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29535 states to 29535 states and 44149 transitions. [2024-11-16 09:12:53,412 INFO L78 Accepts]: Start accepts. Automaton has 29535 states and 44149 transitions. Word has length 107 [2024-11-16 09:12:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:53,413 INFO L471 AbstractCegarLoop]: Abstraction has 29535 states and 44149 transitions. [2024-11-16 09:12:53,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 09:12:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 29535 states and 44149 transitions. [2024-11-16 09:12:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 09:12:53,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:53,452 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-16 09:12:53,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:12:53,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:53,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -777789897, now seen corresponding path program 1 times [2024-11-16 09:12:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851199655] [2024-11-16 09:12:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 09:12:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:12:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 09:12:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 09:12:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851199655] [2024-11-16 09:12:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851199655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:12:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310300990] [2024-11-16 09:12:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:12:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:12:53,604 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-11-16 09:12:53,608 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-11-16 09:12:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:53,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:12:53,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:12:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-16 09:12:53,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:12:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310300990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:12:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:12:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-16 09:12:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843899112] [2024-11-16 09:12:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:12:53,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:12:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:12:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:12:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:12:53,827 INFO L87 Difference]: Start difference. First operand 29535 states and 44149 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:12:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:12:56,300 INFO L93 Difference]: Finished difference Result 83550 states and 124097 transitions. [2024-11-16 09:12:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:12:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 176 [2024-11-16 09:12:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:12:56,446 INFO L225 Difference]: With dead ends: 83550 [2024-11-16 09:12:56,447 INFO L226 Difference]: Without dead ends: 56152 [2024-11-16 09:12:56,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:12:56,502 INFO L432 NwaCegarLoop]: 4302 mSDtfsCounter, 4251 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:12:56,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 4616 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:12:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56152 states. [2024-11-16 09:12:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56152 to 55627. [2024-11-16 09:12:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55627 states, 50673 states have (on average 1.4440234444378663) internal successors, (73173), 51062 states have internal predecessors, (73173), 3136 states have call successors, (3136), 1561 states have call predecessors, (3136), 1816 states have return successors, (6117), 3067 states have call predecessors, (6117), 3134 states have call successors, (6117) [2024-11-16 09:12:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55627 states to 55627 states and 82426 transitions. [2024-11-16 09:12:59,582 INFO L78 Accepts]: Start accepts. Automaton has 55627 states and 82426 transitions. Word has length 176 [2024-11-16 09:12:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:12:59,583 INFO L471 AbstractCegarLoop]: Abstraction has 55627 states and 82426 transitions. [2024-11-16 09:12:59,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:12:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 55627 states and 82426 transitions. [2024-11-16 09:12:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 09:12:59,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:12:59,639 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-16 09:12:59,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 09:12:59,839 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,SelfDestructingSolverStorable12 [2024-11-16 09:12:59,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:12:59,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:12:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1454955663, now seen corresponding path program 1 times [2024-11-16 09:12:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:12:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689485191] [2024-11-16 09:12:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:12:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:12:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:12:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:12:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:12:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:12:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 09:12:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:12:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 09:12:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:12:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 09:12:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:12:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689485191] [2024-11-16 09:12:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689485191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:12:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866588774] [2024-11-16 09:12:59,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:12:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:12:59,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:12:59,995 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-11-16 09:12:59,996 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-11-16 09:13:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:00,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:13:00,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:13:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-16 09:13:00,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:13:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866588774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:13:00,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:13:00,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-16 09:13:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806031041] [2024-11-16 09:13:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:13:00,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:13:00,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:13:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:13:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:13:00,211 INFO L87 Difference]: Start difference. First operand 55627 states and 82426 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:13:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:13:05,129 INFO L93 Difference]: Finished difference Result 161046 states and 238478 transitions. [2024-11-16 09:13:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:13:05,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 176 [2024-11-16 09:13:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:13:05,455 INFO L225 Difference]: With dead ends: 161046 [2024-11-16 09:13:05,455 INFO L226 Difference]: Without dead ends: 107556 [2024-11-16 09:13:05,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:13:05,551 INFO L432 NwaCegarLoop]: 4302 mSDtfsCounter, 4245 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4245 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:13:05,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4245 Valid, 4616 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:13:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107556 states. [2024-11-16 09:13:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107556 to 106511. [2024-11-16 09:13:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106511 states, 96871 states have (on average 1.4374477397776424) internal successors, (139247), 97646 states have internal predecessors, (139247), 6006 states have call successors, (6006), 3121 states have call predecessors, (6006), 3632 states have return successors, (11907), 5807 states have call predecessors, (11907), 6004 states have call successors, (11907) [2024-11-16 09:13:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106511 states to 106511 states and 157160 transitions. [2024-11-16 09:13:11,365 INFO L78 Accepts]: Start accepts. Automaton has 106511 states and 157160 transitions. Word has length 176 [2024-11-16 09:13:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:13:11,366 INFO L471 AbstractCegarLoop]: Abstraction has 106511 states and 157160 transitions. [2024-11-16 09:13:11,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:13:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106511 states and 157160 transitions. [2024-11-16 09:13:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 09:13:11,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:13:11,470 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-16 09:13:11,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 09:13:11,670 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,SelfDestructingSolverStorable13 [2024-11-16 09:13:11,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:13:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:13:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1188209621, now seen corresponding path program 1 times [2024-11-16 09:13:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:13:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970835525] [2024-11-16 09:13:11,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:13:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:13:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:13:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 09:13:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 09:13:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 09:13:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 09:13:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 09:13:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 09:13:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 09:13:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 09:13:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:13:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970835525] [2024-11-16 09:13:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970835525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:13:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230026827] [2024-11-16 09:13:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:13:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:13:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:13:11,802 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-11-16 09:13:11,813 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-11-16 09:13:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:13:11,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 09:13:11,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:13:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 09:13:11,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:13:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230026827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:13:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 09:13:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-16 09:13:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866314797] [2024-11-16 09:13:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:13:11,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:13:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:13:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:13:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:13:11,993 INFO L87 Difference]: Start difference. First operand 106511 states and 157160 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)